Sciweavers

779 search results - page 150 / 156
» A graph polynomial for independent sets of bipartite graphs
Sort
View
ICDM
2009
IEEE
152views Data Mining» more  ICDM 2009»
13 years 5 months ago
A Sparsification Approach for Temporal Graphical Model Decomposition
Temporal causal modeling can be used to recover the causal structure among a group of relevant time series variables. Several methods have been developed to explicitly construct te...
Ning Ruan, Ruoming Jin, Victor E. Lee, Kun Huang
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 7 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
ALGOSENSORS
2009
Springer
14 years 2 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal
ANOR
2005
102views more  ANOR 2005»
13 years 7 months ago
Locating Active Sensors on Traffic Networks
Sensors are used to monitor traffic in networks. For example, in transportation networks, they may be used to measure traffic volumes on given arcs and paths of the network. This p...
Monica Gentili, Pitu B. Mirchandani
ICML
2005
IEEE
14 years 8 months ago
Learning first-order probabilistic models with combining rules
Many real-world domains exhibit rich relational structure and stochasticity and motivate the development of models that combine predicate logic with probabilities. These models de...
Sriraam Natarajan, Prasad Tadepalli, Eric Altendor...