Sciweavers

3875 search results - page 744 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
92
Voted
SIGGRAPH
1995
ACM
15 years 1 months ago
Multiresolution analysis of arbitrary meshes
In computer graphics and geometric modeling, shapes are often represented by triangular meshes. With the advent of laser scanning systems, meshes of extreme complexity are rapidly...
Matthias Eck, Tony DeRose, Tom Duchamp, Hugues Hop...
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
14 years 10 months ago
Fitness calculation approach for the switch-case construct in evolutionary testing
A well-designed fitness function is essential to the effectiveness and efficiency of evolutionary testing. Fitness function design has been researched extensively. For fitness ...
Yan Wang, Zhiwen Bai, Miao Zhang, Wen Du, Ying Qin...
TIT
2008
72views more  TIT 2008»
14 years 9 months ago
On the Construction of (Explicit) Khodak's Code and Its Analysis
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski
ICDE
2007
IEEE
148views Database» more  ICDE 2007»
15 years 11 months ago
Efficient Detection of Distributed Constraint Violations
In many distributed environments, the primary function of monitoring software is to detect anomalies, that is, instances when system behavior deviates substantially from the norm....
Shipra Agrawal, Supratim Deb, K. V. M. Naidu, Raje...
IROS
2009
IEEE
159views Robotics» more  IROS 2009»
15 years 4 months ago
Data gathering tours for mobile robots
— We study a path planning problem which arises when multiple robots are used to gather data from stationary devices with wireless communication capabilities. Each device has a g...
Deepak Bhadauria, Volkan Isler