Sciweavers

420 search results - page 47 / 84
» Search on High Degree Graphs
Sort
View
115
Voted
CIKM
2010
Springer
14 years 10 months ago
Discovery of numerous specific topics via term co-occurrence analysis
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...
Omid Madani, Jiye Yu
101
Voted
SAC
2010
ACM
15 years 7 months ago
Relational consistency by constraint filtering
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
Shant Karakashian, Robert J. Woodward, Berthe Y. C...
103
Voted
JAIR
2010
145views more  JAIR 2010»
14 years 11 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
98
Voted
IROS
2007
IEEE
198views Robotics» more  IROS 2007»
15 years 7 months ago
Topological mapping, localization and navigation using image collections
Abstract— In this paper we present a highly scalable visionbased localization and mapping method using image collections. A topological world representation is created online dur...
Friedrich Fraundorfer, Christopher Engels, David N...
IPPS
1999
IEEE
15 years 5 months ago
Average-Case Analysis of Isospeed Scalability of Parallel Computations on Multiprocessors
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
Keqin Li, Xian-He Sun