Sciweavers

1529 search results - page 272 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
PODC
2005
ACM
14 years 2 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
MIS
2004
Springer
162views Multimedia» more  MIS 2004»
14 years 2 months ago
Integrating the Results of Multimedia Sub-Queries Using Qualitative Preferences
When similarity queries over multimedia databases are processed by splitting the overall query condition into a set of sub-queries, the problem of how to efficiently and effectiv...
Ilaria Bartolini, Paolo Ciaccia, Vincent Oria, M. ...
SAC
2006
ACM
13 years 8 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
ICRA
2009
IEEE
226views Robotics» more  ICRA 2009»
13 years 6 months ago
3D model selection from an internet database for robotic vision
Abstract-- We propose a new method for automatically accessing an internet database of 3D models that are searchable only by their user-annotated labels, for using them for vision ...
Ulrich Klank, Muhammad Zeeshan Zia, Michael Beetz
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
14 years 10 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010