Sciweavers

2398 search results - page 392 / 480
» Constraint Programming and Graph Algorithms
Sort
View
210
Voted
GIS
2009
ACM
16 years 3 months ago
Map-Matching for Low-Sampling-Rate GPS Trajectories
Map-matching is the process of aligning a sequence of observed user positions with the road network on a digital map. It is a fundamental pre-processing step for many applications...
Yin Lou, Chengyang Zhang, Yu Zheng, Xing Xie, Wei ...
TMC
2008
127views more  TMC 2008»
15 years 2 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
ICDE
2006
IEEE
163views Database» more  ICDE 2006»
16 years 3 months ago
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...
Adam Silberstein, Carla Schlatter Ellis, Jun Yang ...
DAC
2009
ACM
16 years 3 months ago
O-Router:an optical routing framework for low power on-chip silicon nano-photonic integration
In this work, we present a new optical routing framework, O-Router for future low-power on-chip optical interconnect integration utilizing silicon compatible nano-photonic devices...
Duo Ding, Yilin Zhang, Haiyu Huang, Ray T. Chen, D...
COR
2008
99views more  COR 2008»
15 years 2 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi