Sciweavers

1648 search results - page 68 / 330
» Where to Build a Door
Sort
View
GLOBECOM
2006
IEEE
14 years 3 months ago
Toposemantic Network Clustering
— We study the problem of building an optimal network-layer clustering hierarchy, where the optimality can be defined using three potentially conflicting metrics: state, delay ...
Leonid B. Poutievski, Kenneth L. Calvert, Jim Grif...
ICML
2008
IEEE
14 years 10 months ago
Composite kernel learning
The Support Vector Machine (SVM) is an acknowledged powerful tool for building classifiers, but it lacks flexibility, in the sense that the kernel is chosen prior to learning. Mul...
Marie Szafranski, Yves Grandvalet, Alain Rakotomam...
ICTIR
2009
Springer
14 years 4 months ago
A Quantum-Based Model for Interactive Information Retrieval
Abstract Even the best information retrieval model cannot always identify the most useful answers to a user query. This is in particular the case with web search systems, where it ...
Benjamin Piwowarski, Mounia Lalmas
SPIRE
2009
Springer
14 years 4 months ago
A Linear-Time Burrows-Wheeler Transform Using Induced Sorting
To compute Burrows-Wheeler Transform (BWT), one usually builds a suffix array (SA) first, and then obtains BWT using SA, which requires much redundant working space. In previous ...
Daisuke Okanohara, Kunihiko Sadakane
IROS
2007
IEEE
99views Robotics» more  IROS 2007»
14 years 4 months ago
Multi-robot routing with rewards and disjoint time windows
Abstract— Multiple robots are often faster and more faulttolerant than single robots for applications such as planetary exploration and search and rescue. We study applications w...
Justin Melvin, Pinar Keskinocak, Sven Koenig, Crai...