Sciweavers

315 search results - page 55 / 63
» Simple Distributed Weighted Matchings
Sort
View
INFOCOM
2006
IEEE
14 years 1 months ago
SmartSeer: Using a DHT to Process Continuous Queries Over Peer-to-Peer Networks
— As the academic world moves away from physical journals and proceedings towards online document repositories, the ability to efficiently locate work of interest among the torr...
Jayanthkumar Kannan, Beverly Yang, Scott Shenker, ...
BMCBI
2010
178views more  BMCBI 2010»
13 years 7 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
SOICT
2010
13 years 2 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
ICSE
2008
IEEE-ACM
14 years 8 months ago
Symbolic mining of temporal specifications
Program specifications are important in many phases of the software development process, but they are often omitted or incomplete. An important class of specifications takes the f...
Mark Gabel, Zhendong Su
INFOCOM
2008
IEEE
14 years 2 months ago
iBubble: Multi-Keyword Routing Protocol for Heterogeneous Wireless Sensor Networks
— Many tasks require multiple sensing capabilities; in Wireless Sensor Networks (WSN), it is expensive to deploy a homogeneous network wherein every sensor has the same functiona...
Xiaoming Lu, Matt Spear, Karl N. Levitt, Shyhtsun ...