Sciweavers

2009 search results - page 140 / 402
» Dense Interest Points
Sort
View
133
Voted
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
16 years 14 days ago
Don't Compare Averages
We point out that for two sets of measurements, the sign of the difference of their averages is not necessarily maintained by a non-linear monotone transformation of the individu...
Holger Bast, Ingmar Weber
220
Voted
COLT
2004
Springer
16 years 12 days ago
On the Convergence of Spectral Clustering on Random Samples: The Normalized Case
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
Ulrike von Luxburg, Olivier Bousquet, Mikhail Belk...
195
Voted
HUC
2004
Springer
16 years 11 days ago
'This All Together, Hon?' Ubicomp in Non-office Work Environments
Ubiquitous computing technologies offer the promise of extending the benefits of computing to workers who do not spend their time at a desktop environment. In this paper, we review...
John Sherry, Scott D. Mainwaring, Jenna Burrell, R...
198
Voted
ICTAC
2004
Springer
16 years 11 days ago
Replicative - Distribution Rules in P Systems with Active Membranes
Abstract. P systems (known also as membrane systems) are biologically motivated theoretical models of distributed and parallel computing. The two most interesting questions in the ...
Tseren-Onolt Ishdorj, Mihai Ionescu
146
Voted
COMPGEOM
2003
ACM
16 years 7 days ago
High-dimensional shape fitting in linear time
Let P be a set of n points in Rd. The radius of a k-dimensional flat F with respect to P, denoted by RD(F, P), is defined to be maxp∈P dist(F, p), where dist(F, p) denotes the...
Sariel Har-Peled, Kasturi R. Varadarajan