Sciweavers

2262 search results - page 94 / 453
» Points with large quadrant-depth
Sort
View
ML
2006
ACM
15 years 6 months ago
A Unified View on Clustering Binary Data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li
SIGACT
2008
103views more  SIGACT 2008»
15 years 6 months ago
Computational geometry column 50
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
Joseph O'Rourke
SIAMCO
2002
71views more  SIAMCO 2002»
15 years 6 months ago
Rate of Convergence for Constrained Stochastic Approximation Algorithms
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
Robert Buche, Harold J. Kushner
VLSID
2004
IEEE
170views VLSI» more  VLSID 2004»
16 years 6 months ago
On-chip networks: A scalable, communication-centric embedded system design paradigm
As chip complexity grows, design productivity boost is expected from reuse of large parts and blocks of previous designs with the design effort largely invested into the new parts...
Jörg Henkel, Srimat T. Chakradhar, Wayne Wolf
ACL
1994
15 years 7 months ago
Compact Representations by Finite-State Transducers
Finite-state transducers give efficient representations of many Natural Language phenomena. They allow to account for complex lexicon restrictions encountered, without involving t...
Mehryar Mohri