Sciweavers

92 search results - page 13 / 19
» Making the Breakout Algorithm Complete Using Systematic Sear...
Sort
View
SIGIR
2009
ACM
15 years 4 months ago
Dynamicity vs. effectiveness: studying online clustering for scatter/gather
We proposed and implemented a novel clustering algorithm called LAIR2, which has constant running time average for on-the-fly Scatter/Gather browsing [4]. Our experiments showed ...
Weimao Ke, Cassidy R. Sugimoto, Javed Mostafa
ISRR
2001
Springer
161views Robotics» more  ISRR 2001»
15 years 1 months ago
A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
Gildardo Sánchez-Ante, Jean-Claude Latombe
LCTRTS
2004
Springer
15 years 2 months ago
Finding effective compilation sequences
Most modern compilers operate by applying a fixed, program-independent sequence of optimizations to all programs. Compiler writers choose a single “compilation sequence”, or ...
L. Almagor, Keith D. Cooper, Alexander Grosul, Tim...
ECML
1987
Springer
15 years 28 days ago
Induction in Noisy Domains
This paper examines the induction of classification rules from examples using real-world data. Real-world data is almost always characterized by two features, which are important ...
Peter Clark, Tim Niblett
RECSYS
2009
ACM
15 years 4 months ago
Latent dirichlet allocation for tag recommendation
Tagging systems have become major infrastructures on the Web. They allow users to create tags that annotate and categorize content and share them with other users, very helpful in...
Ralf Krestel, Peter Fankhauser, Wolfgang Nejdl