Sciweavers

4797 search results - page 111 / 960
» The complexity of partition tasks
Sort
View
VMV
2003
154views Visualization» more  VMV 2003»
13 years 11 months ago
Piecewise Linear Approximation of Signed Distance Fields
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient a...
Jianhua Wu, Leif Kobbelt
IJHIS
2007
89views more  IJHIS 2007»
13 years 10 months ago
A new hybrid heuristic for driver scheduling
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
Geraldo R. Mauri, Luiz Antonio Nogueira Lorena
EMNLP
2008
13 years 11 months ago
Seeded Discovery of Base Relations in Large Corpora
Relationship discovery is the task of identifying salient relationships between named entities in text. We propose novel approaches for two sub-tasks of the problem: identifying t...
Nicholas Andrews, Naren Ramakrishnan
SMC
2007
IEEE
110views Control Systems» more  SMC 2007»
14 years 4 months ago
A validity index based on cluster symmetry
— An important consideration in clustering is the determination of the correct number of clusters and the appropriate partitioning of a given data set. In this paper, a newly dev...
Sriparna Saha, Sanghamitra Bandyopadhyay
TON
2002
82views more  TON 2002»
13 years 9 months ago
On multicast flow control for heterogeneous receivers
In this paper, we study the impact of heterogeneous receivers on the throughput of multicast flow control and propose a new multicast flow control algorithm to optimally partition ...
Rung-Hung Gau, Zygmunt J. Haas, Bhaskar Krishnamac...