2520 search results - page 239 / 504 » The complexity of approximating entropy |
201
click to vote
SI3D
2005
ACM
16 years 4 days ago
2005
ACM
We present a sampling strategy and rendering framework for intersectable models, whose surface is implicitly defined by a black box intersection test that provides the location a...
191
click to vote
EMMCVPR
2005
Springer
16 years 3 days ago
2005
Springer
This paper addresses the problem of efficient information theoretic, non-parametric data clustering. We develop a procedure for adapting the cluster memberships of the data pattern...
200
click to vote
AMAI
2004
Springer
15 years 12 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
140
click to vote
ESA
2004
Springer
15 years 12 months ago
2004
Springer
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
154
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents an efficient approach to compute the dominant poles for the reduced-order admittance (Y parameter) matrix of lossy interconnects. Using the global approximati...