Sciweavers

3837 search results - page 595 / 768
» Learning Approximate Consistencies
Sort
View
ICALP
2009
Springer
16 years 6 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
WISEC
2009
ACM
16 years 1 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
EDBT
2009
ACM
208views Database» more  EDBT 2009»
16 years 1 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...
ICRA
2009
IEEE
211views Robotics» more  ICRA 2009»
16 years 1 months ago
Climbing rough vertical surfaces with hierarchical directional adhesion
— Prior research in biology and mechanics has shown the importance of hierarchy to the performance of dry adhesive systems on rough surfaces. The gecko utilizes several levels of...
Alan T. Asbeck, Sanjay Dastoor, Aaron Parness, Lau...
FOCS
2008
IEEE
16 years 28 days ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...