Sciweavers

221 search results - page 22 / 45
» New formulations for the Kissing Number Problem
Sort
View
WWW
2011
ACM
14 years 4 months ago
Query completion without query logs for song search
We describe a new method for query completion for Bollywood song search without using query logs. Since song titles in nonEnglish languages (Hindi in our case) are mostly present ...
Nitin Dua, Kanika Gupta, Monojit Choudhury, Kalika...
IJSNET
2007
95views more  IJSNET 2007»
14 years 9 months ago
On extracting consistent graphs in wireless sensor networks
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...
Murtuza Jadliwala, Qi Duan, Jinhui Xu, Shambhu J. ...
SIGGRAPH
2010
ACM
15 years 1 months ago
Volume contact constraints at arbitrary resolution
We introduce a new method for simulating frictional contact between volumetric objects using interpenetration volume constraints. When applied to complex geometries, our formulati...
Jérémie Allard, François Faure, Hadrien Courtec...
CP
2003
Springer
15 years 2 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
IPPS
2007
IEEE
15 years 4 months ago
Strategies for Replica Placement in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
Anne Benoit, Veronika Rehn, Yves Robert