Sciweavers

2489 search results - page 124 / 498
» On the Subgroup Distance Problem
Sort
View
146
Voted
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
15 years 3 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
ICDE
2006
IEEE
160views Database» more  ICDE 2006»
16 years 5 months ago
Surface k-NN Query Processing
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
Ke Deng, Xiaofang Zhou, Heng Tao Shen, Kai Xu 0003...
ICDM
2007
IEEE
121views Data Mining» more  ICDM 2007»
15 years 10 months ago
Finding Predictive Runs with LAPS
We present an extension to the Lasso [9] for binary classification problems with ordered attributes. Inspired by the Fused Lasso [8] and the Group Lasso [10, 4] models, we aim to...
Suhrid Balakrishnan, David Madigan
139
Voted
IEEECGIV
2005
IEEE
15 years 9 months ago
Combinations of Range Data and Panoramic Images - New Opportunities in 3D Scene Modeling
The paper informs about rotating line cameras (which capture images of several 100 Megapixel), their use for creating (stereo) panoramas, and how they can be used for texturing cl...
Reinhard Klette, Karsten Scheibe
142
Voted
SFP
2003
15 years 5 months ago
Testing Scheme programming assignments automatically
Abstract In distance learning the lack of direct communication between teachers and learners makes it difficult to provide direct assistance to students while they are solving the...
Manfred Widera