| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Javed A. Aslam Javed A. Aslam, Virgiliu Pavlu , Robert Savell : A unified model for metasearch, pooling, and system evaluation. CIKM 2003 : 484-491 Qun Li , Javed A. Aslam, Daniela Rus : Distributed Energy-conserving Routing Protocols. HICSS 2003 : 301 Javed A. Aslam, Robert Savell : On the effectiveness of evaluating retrieval systems in the absence of relevance judgments. SIGIR 2003 : 361-362 Javed A. Aslam, Virgiliu Pavlu , Robert Savell : A unified model for metasearch and the efficient evaluation of retrieval systems via the hedge algorithm. SIGIR 2003 : 393-394 Javed A. Aslam, Meredith Frost : An information-theoretic measure for document similarity. SIGIR 2003 : 449-450 Mark H. Montague , Javed A. Aslam: Condorcet fusion for improved retrieval. CIKM 2002 : 538-548 Mark H. Montague , Javed A. Aslam: Relevance Score Normalization for Metasearch. CIKM 2001 : 427-433 Qun Li , Javed A. Aslam, Daniela Rus : Online power-aware routing in wireless Ad-hoc networks. MOBICOM 2001 : 97-107 Javed A. Aslam, Mark H. Montague : Models for Metasearch. SIGIR 2001 : 275-284 Javed A. Aslam, Mark H. Montague : Metasearch Consistency. SIGIR 2001 : 386-387 Javed A. Aslam, Alain Leblanc , Clifford Stein : Clustering Data without Prior Knowledge. Algorithm Engineering 2000 : 74-86 Javed A. Aslam, Katya Pelekhov , Daniela Rus : Using Star Clusters for Filtering. CIKM 2000 : 306-313 Javed A. Aslam: Improving Algorithms for Boosting. COLT 2000 : 200-207 Javed A. Aslam, Mark H. Montague : Bayes optimal metasearch: a probabilistic model for combining the results. SIGIR 2000 : 379-381 Javed A. Aslam, Katya Pelekhov , Daniela Rus : A Practical Clustering Algorithm for Static and Dynamic Information Organization. SODA 1999 : 51-60 Javed A. Aslam, April Rasala , Clifford Stein , Neal E. Young : Improved Bicriteria Existence Theorems for Scheduling. SODA 1999 : 846-847 Javed A. Aslam, Katya Pelekhov , Daniela Rus : Static and Dynamic Information Organization with Star Clusters. CIKM 1998 : 208-217 Javed A. Aslam, Katya Pelekhov , Daniela Rus : Generating, Visualizing, and Evaluating High-Quality Clusters for Information Organization. PODDP 1998 : 53-69 Javed A. Aslam, Scott E. Decatur : General Bounds on Statistical Query Learning and PAC Learning with Noise via Hypothesis Boosting. Inf. Comput. 141 (2): 85-118 (1998) Javed A. Aslam, Scott E. Decatur : Specification and Simulation of Statistical Query Algorithms for Efficiency and Noise Tolerance. J. Comput. Syst. Sci. 56 (2): 191-208 (1998) Javed A. Aslam, Scott E. Decatur : On the Sample Complexity of Noise-Tolerant Learning. Inf. Process. Lett. 57 (4): 189-195 (1996) Javed A. Aslam, Scott E. Decatur : Specification and Simulation of Statistical Query Algorithms for Efficiency and Noise Tolerance. COLT 1995 : 437-446 Javed A. Aslam, Scott E. Decatur : General Bounds on Statistical Query Learning and PAC Learning with Noise via Hypothesis Bounding FOCS 1993 : 282-291 Javed A. Aslam, Aditi Dhagat : On-Line Algorithms for 2-Coloring Hypergraphs Via Chip Games. Theor. Comput. Sci. 112 (2): 355-369 (1993) Javed A. Aslam, Aditi Dhagat : Searching in the Presence of Linearly Bounded Errors (Extended Abstract) STOC 1991 : 486-493 Javed A. Aslam, Ronald L. Rivest : Inferring Graphs from Walks. COLT 1990 : 359-370 1 [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] 2 [ 2 ] [ 3 ] 3 [ 22 ] 4 [ 16 ] 5 [ 19 ] [ 25 ] 6 [ 13 ] [ 17 ] [ 18 ] [ 20 ] [ 21 ] 7 [ 23 ] [ 26 ] 8 [ 9 ] [ 10 ] [ 12 ] [ 15 ] 9 [ 11 ] 10 [ 1 ] 11 [ 9 ] [ 10 ] [ 12 ] [ 15 ] [ 19 ] [ 25 ] 12 [ 23 ] [ 24 ] [ 26 ] 13 [ 11 ] [ 16 ] 14 [ 11 ]  ©2004 Association for Computing Machinery |
