Sciweavers

1983 search results - page 305 / 397
» Competitive graph searches
Sort
View
ESCIENCE
2007
IEEE
13 years 11 months ago
A Scalable and Efficient Prefix-Based Lookup Mechanism for Large-Scale Grids
Data sources, storage, computing resources and services are entities on Grids that require mechanisms for publication and lookup. A discovery service relies on efficient lookup to...
Philip Chan, David Abramson
APVIS
2008
13 years 9 months ago
Interactive Visual Analysis of the NSF Funding Information
This paper presents an interactive visualization toolkit for navigating and analyzing the National Science Foundation (NSF) funding information. Our design builds upon the treemap...
Shixia Liu, Nan Cao, Hao Lv
NIPS
2001
13 years 9 months ago
Unsupervised Learning of Human Motion Models
This paper presents an unsupervised learning algorithm that can derive the probabilistic dependence structure of parts of an object (a moving human body in our examples) automatic...
Yang Song, Luis Goncalves, Pietro Perona
AIPS
2000
13 years 9 months ago
Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
Minh Binh Do, Biplav Srivastava, Subbarao Kambhamp...
SIGIR
2002
ACM
13 years 7 months ago
Generic summarization and keyphrase extraction using mutual reinforcement principle and sentence clustering
A novel method for simultaneous keyphrase extraction and generic text summarization is proposed by modeling text documents as weighted undirected and weighted bipartite graphs. Sp...
Hongyuan Zha