Sciweavers

1941 search results - page 181 / 389
» On the Hardness of Approximate Reasoning
Sort
View
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...
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
16 years 1 months ago
Improved Inapproximability Results for Maximum k-Colorable Subgraph
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
Venkatesan Guruswami, Ali Kemal Sinop
WINE
2005
Springer
109views Economy» more  WINE 2005»
15 years 12 months ago
Subjective-Cost Policy Routing
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
Joan Feigenbaum, David R. Karger, Vahab S. Mirrokn...
SCA
2007
15 years 9 months ago
Time-critical distributed contact for 6-DoF haptic rendering of adaptively sampled reduced deformable models
Real-time evaluation of distributed contact forces for rigid or deformable 3D objects is important for providing multi-sensory feedback in emerging real-time applications, such as...
Jernej Barbic, Doug L. James