Sciweavers

817 search results - page 69 / 164
» An Optimal Linear Time Algorithm for Quasi-Monotonic Segment...
Sort
View
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 3 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
RTSS
2005
IEEE
15 years 9 months ago
Voltage Scaling Scheduling for Periodic Real-Time Tasks in Reward Maximization
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...
Jian-Jia Chen, Tei-Wei Kuo
125
Voted
GD
2008
Springer
15 years 4 months ago
Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
In this paper we present a generalization of the shift method algorithm [4, 6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a c...
Seok-Hee Hong, Martin Mader
211
Voted
ICDAR
2009
IEEE
15 years 1 months ago
Document Content Extraction Using Automatically Discovered Features
We report an automatic feature discovery method that achieves results comparable to a manually chosen, larger feature set on a document image content extraction problem: the locat...
Sui-Yu Wang, Henry S. Baird, Chang An
111
Voted
ICIP
2007
IEEE
16 years 5 months ago
Distancecut: Interactive Segmentation and Matting of Images and Videos
An interactive algorithm for soft segmentation and matting of natural images and videos is presented in this paper. The technique follows and extends [10], where the user first ro...
Xue Bai, Guillermo Sapiro