6315 search results - page 393 / 1263 » Approximating Solution Structure |
165
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
158
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Histogram construction or sequence segmentation is a basic task with applications in database systems, information retrieval, and knowledge management. Its aim is to approximate a...
186
click to vote
CIBCB
2007
IEEE
16 years 1 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
185
click to vote
WEA
2007
Springer
16 years 29 days ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
172
click to vote
ICNP
2006
IEEE
16 years 27 days ago
2006
IEEE
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...