Sciweavers

284 search results - page 35 / 57
» What Matchings Can Be Stable
Sort
View
AO
2006
127views more  AO 2006»
13 years 8 months ago
Formal ontology meets industry
in ontology is quite abstract and often based on toy-examples to the point that the gap between the work of theoreticians and the needs of real applications is too wide to be cross...
Stefano Borgo, Matteo Cristani, Roberta Cuel
ISMIR
2000
Springer
190views Music» more  ISMIR 2000»
14 years 2 days ago
Music IR: Past, Present, and Future
Music Information Retrieval has a longer history than most people realise, with systems developed in the 1960's. The field has its roots in information retrieval, musicology ...
Alexandra L. Uitdenbogerd
OSDI
2008
ACM
14 years 8 months ago
SQCK: A Declarative File System Checker
The lowly state of the art for file system checking and repair does not match what is needed to keep important data available for users. Current file system checkers, such as e2fs...
Haryadi S. Gunawi, Abhishek Rajimwale, Andrea C. A...
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
ICRA
2010
IEEE
145views Robotics» more  ICRA 2010»
13 years 7 months ago
High quality pose estimation by aligning multiple scans to a latent map
Abstract— We introduce a method for fast and accurate registration of multiple horizontal laser scans obtained by a mobile robot. The method is based on novel representation of t...
Qi-Xing Huang, Dragomir Anguelov