Sciweavers

9842 search results - page 1756 / 1969
» Problem complexity
Sort
View
BMCBI
2007
145views more  BMCBI 2007»
15 years 6 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...
CGF
2005
107views more  CGF 2005»
15 years 6 months ago
Predictive Feedback for Interactive Control of Physics-based Characters
Interactive control of a physically simulated character is a challenging problem, due both to the complexity of controlling multiple degrees of freedom with lower dimensional inpu...
Joe Laszlo, Michael Neff, Karan Singh
PVLDB
2008
197views more  PVLDB 2008»
15 years 6 months ago
Dynamic partitioning of the cache hierarchy in shared data centers
Due to the imperative need to reduce the management costs of large data centers, operators multiplex several concurrent database applications on a server farm connected to shared ...
Gokul Soundararajan, Jin Chen, Mohamed A. Sharaf, ...
VLDB
2007
ACM
104views Database» more  VLDB 2007»
16 years 6 months ago
Extending Dependencies with Conditions
This paper introduces a class of conditional inclusion dependencies (CINDs), which extends traditional inclusion dependencies (INDs) by enforcing bindings of semantically related ...
Loreto Bravo, Wenfei Fan, Shuai Ma
PODS
2002
ACM
167views Database» more  PODS 2002»
16 years 6 months ago
OLAP Dimension Constraints
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
Carlos A. Hurtado, Alberto O. Mendelzon
« Prev « First page 1756 / 1969 Last » Next »