Sciweavers

1670 search results - page 217 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
INFOCOM
2002
IEEE
15 years 8 months ago
Routing Restorable Bandwidth Guaranteed Connections using Maximum 2-Route Flows
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...
Koushik Kar, Murali S. Kodialam, T. V. Lakshman
ICDE
2009
IEEE
177views Database» more  ICDE 2009»
16 years 4 months ago
Light-Weight, Runtime Verification of Query Sources
Modern database systems increasingly make use of networked storage. This storage can be in the form of SAN's or in the form of shared-nothing nodes in a cluster. One type of a...
Tingjian Ge, Stanley B. Zdonik
BMCBI
2006
95views more  BMCBI 2006»
15 years 3 months ago
XcisClique: analysis of regulatory bicliques
Background: Modeling of cis-elements or regulatory motifs in promoter (upstream) regions of genes is a challenging computational problem. In this work, set of regulatory motifs si...
Amrita Pati, Cecilia Vasquez-Robinet, Lenwood S. H...
ICANN
2007
Springer
15 years 9 months ago
Structure Learning with Nonparametric Decomposable Models
Abstract. We present a novel approach to structure learning for graphical models. By using nonparametric estimates to model clique densities in decomposable models, both discrete a...
Anton Schwaighofer, Mathäus Dejori, Volker Tr...
ICALP
2003
Springer
15 years 8 months ago
Optimal Cache-Oblivious Implicit Dictionaries
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...
Gianni Franceschini, Roberto Grossi