Sciweavers

1190 search results - page 188 / 238
» On the Structure of Syntenic Distance
Sort
View
LATIN
2010
Springer
14 years 3 months ago
Layered Working-Set Trees
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
ICDE
2009
IEEE
126views Database» more  ICDE 2009»
14 years 3 months ago
Querying Communities in Relational Databases
— Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is speci...
Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao
ICRA
2009
IEEE
148views Robotics» more  ICRA 2009»
14 years 3 months ago
Active guidance of a handheld micromanipulator using visual servoing
²In microsurgery, a surgeon often deals with anatomical structures of sizes that are close to the limit of the human hand accuracy. Robotic assistants can help to push beyond the ...
Brian C. Becker, Sandrine Voros, Robert A. MacLach...
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
14 years 3 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
ESWS
2009
Springer
14 years 3 months ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...