6315 search results - page 48 / 1263 » Approximating Solution Structure |
156
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
96
Voted
CC
2002
Springer
15 years 18 days ago
2002
Springer
We show that for several natural classes of "structured" matrices, including symmetric, circulant, Hankel and Toeplitz matrices, approximating the permanent modulo a prim...
112
click to vote
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
114
click to vote
ICCS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Infinite contexts and their corresponding lattices are of theoretical and practical interest since they may offer connections with and insights from other mathematical ...
100
Voted
GCB
2001
Springer
15 years 5 months ago
2001
Springer
: We derive an approximate Bayesian hypothesis test to discriminate between alternative mosaic structures of DNA sequence alignments, and test the viability of this approach on a s...