Sciweavers

1402 search results - page 241 / 281
» Sparse-Memory Graph Search
Sort
View
ESCIENCE
2007
IEEE
15 years 3 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
15 years 1 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
15 years 1 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
15 years 1 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...
HEURISTICS
2006
120views more  HEURISTICS 2006»
14 years 11 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet