Sciweavers

1431 search results - page 11 / 287
» The complexity of random ordered structures
Sort
View
BMCBI
2007
109views more  BMCBI 2007»
13 years 7 months ago
Computational RNA secondary structure design: empirical complexity and improved methods
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
Rosalía Aguirre-Hernández, Holger H....
JMLR
2012
11 years 9 months ago
Structured Output Learning with High Order Loss Functions
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
Daniel Tarlow, Richard S. Zemel
ICDE
2010
IEEE
173views Database» more  ICDE 2010»
14 years 2 months ago
Progressive clustering of networks using Structure-Connected Order of Traversal
— Network clustering enables us to view a complex network at the macro level, by grouping its nodes into units whose characteristics and interrelationships are easier to analyze ...
Dustin Bortner, Jiawei Han
SBACPAD
2005
IEEE
139views Hardware» more  SBACPAD 2005»
14 years 29 days ago
Chained In-Order/Out-of-Order DoubleCore Architecture
Complexity is one of the most important problems facing microarchitects. It is exacerbated by the application of optimizations, by scaling to higher issue widths and, in general, ...
Miquel Pericàs, Adrián Cristal, Rube...
EDBTW
2004
Springer
14 years 24 days ago
L-Tree: A Dynamic Labeling Structure for Ordered XML Data
With the ever growing use of XML as a data representation format, we see an increasing need for robust, high performance XML database systems. While most of the recent work focuses...
Yi Chen, George A. Mihaila, Rajesh Bordawekar, Sri...