Sciweavers

1158 search results - page 139 / 232
» Software is discrete mathematics
Sort
View
111
Voted
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 1 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 7 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
134
Voted
AMIRE
2005
Springer
198views Robotics» more  AMIRE 2005»
15 years 6 months ago
Extending the Temporal Horizon of Autonomous Robots
Abstract. We introduce mathematically rigorous metrics on agent experiences having various temporal horizons. Sensorimotor variables accessible to the agent are treated as informat...
Chrystopher L. Nehaniv, Naeem Assif Mirza, Kerstin...
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
15 years 6 months ago
Evolving petri nets to represent metabolic pathways
Given concentrations of metabolites over a sequence of time steps, the metabolic pathway prediction problem seeks a set of reactions and rate constants for them that could yield t...
Jeremiah Nummela, Bryant A. Julstrom
CORR
2011
Springer
152views Education» more  CORR 2011»
14 years 7 months ago
Topology Discovery of Sparse Random Graphs With Few Participants
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
Animashree Anandkumar, Avinatan Hassidim, Jonathan...