1431 search results - page 23 / 287 » The complexity of random ordered structures |
101
click to vote
JMLR
2012
13 years 2 days ago
2012
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
Until now, structured and unstructured networks have been considered in absentia of each other. We believe that next-generation P2P services will require both structured and unstr...
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
BIOCOMP
2006
14 years 11 months ago
2006
Abstract-- The inference of a network structure from experimental data providing dynamical information about the underlying system of investigation is an important and still outsta...
ISCIS
2005
Springer
15 years 3 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...