Sciweavers

1364 search results - page 112 / 273
» Collective Optimization
Sort
View
CPM
1999
Springer
92views Combinatorics» more  CPM 1999»
14 years 2 months ago
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
Serafim Batzoglou, Sorin Istrail
IJCAI
1989
13 years 11 months ago
Constraint Satisfiability Algorithms for Interactive Student Scheduling
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
Ronen Feldman, Martin Charles Golumbic
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 10 months ago
On the Convexity of Latent Social Network Inference
In many real-world scenarios, it is nearly impossible to collect explicit social network data. In such cases, whole networks must be inferred from underlying observations. Here, w...
Seth A. Myers, Jure Leskovec
JCP
2008
142views more  JCP 2008»
13 years 10 months ago
QoS Aware Query Processing Algorithm for Wireless Sensor Networks
In sensor networks, continuous query is commonly used for collecting periodical data from the objects under monitoring. This sort of queries needs to be carefully designed, in orde...
Jun-Zhao Sun
CORR
2007
Springer
143views Education» more  CORR 2007»
13 years 10 months ago
On Myopic Sensing for Multi-Channel Opportunistic Access
We consider a multi-channel opportunistic communication system where the states of these channels evolve as independent and statistically identical Markov chains (the Gilbert-Elli...
Qing Zhao, Bhaskar Krishnamachari, Keqin Liu