Sciweavers

724 search results - page 113 / 145
» Practical Performance of Efficient Minimum Cut Algorithms
Sort
View
DLOG
2010
15 years 1 months ago
Correcting Access Restrictions to a Consequence
Recent research has shown that annotations are useful for representing access restrictions to the axioms of an ontology and their implicit consequences. Previous work focused on co...
Martin Knechtel, Rafael Peñaloza
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
15 years 2 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
GEOINFORMATICA
2002
136views more  GEOINFORMATICA 2002»
15 years 2 months ago
Tabu Search Heuristic for Point-Feature Cartographic Label Placement
The generation of better label placement configurations in maps is a problem that comes up in automated cartographic production. The objective of a good label placement is to displ...
Missae Yamamoto, Gilberto Câmara, Luiz Anton...
211
Voted
ICDE
2006
IEEE
163views Database» more  ICDE 2006»
16 years 4 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
2002
ACM
16 years 4 months ago
Schedulability of event-driven code blocks in real-time embedded systems
Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Tasks in many such systems, like netwo...
Samarjit Chakraborty, Thomas Erlebach, Simon K&uum...