Sciweavers

578 search results - page 77 / 116
» The Minimum-Entropy Set Cover Problem
Sort
View
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 9 months ago
Efficient Query Evaluation over Compressed XML Data
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
Andrei Arion, Angela Bonifati, Gianni Costa, Sandr...
WADS
2007
Springer
98views Algorithms» more  WADS 2007»
14 years 3 months ago
Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
Senjuti Basu Roy, Gautam Das, Sajal Das
GEOINFO
2004
13 years 10 months ago
Urban Planning by Simulation of Population Growth
: Urban planning is a very important issue to guarantee the sustainable development of modern towns. Many aspects must be considered and one of the most important is the population...
Cirano Iochpe, Flávio Rech Wagner, Andr&eac...
JEI
2007
79views more  JEI 2007»
13 years 8 months ago
Stereo matching via selective multiple windows
Window-based correlation algorithms are widely used for stereo matching due to their computational efficiency as compared to global algorithms. In this paper, a multiple window co...
Satyajit Anil Adhyapak, Nasser D. Kehtarnavaz, Mih...
ICDCS
2010
IEEE
13 years 10 months ago
Minimizing Probing Cost and Achieving Identifiability in Network Link Monitoring
Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. I...
Qiang Zheng, Guohong Cao