Sciweavers

336 search results - page 29 / 68
» Improved data structures for fully dynamic biconnectivity
Sort
View
FGCS
2008
90views more  FGCS 2008»
14 years 12 months ago
Powerful resource discovery for Arigatoni overlay network
Arigatoni is a structured multi-layer overlay network providing various services with variable guarantees, and promoting an intermittent participation in the overlay since peers c...
Raphaël Chand, Michel Cosnard, Luigi Liquori
PLDI
2012
ACM
13 years 2 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
PEPM
1994
ACM
15 years 3 months ago
The Essence of Eta-Expansion in Partial Evaluation
Abstract. Selective eta-expansion is a powerful "binding-time improvement", i.e., a sourceprogram modification that makes a partial evaluator yield better results. But li...
Olivier Danvy, Karoline Malmkjær, Jens Palsb...
103
Voted
ITCC
2005
IEEE
15 years 5 months ago
Performance Analysis of Mobile Backbone Topology Synthesis Algorithm for Wireless Ad Hoc Networks
In this paper, we present a scalable fully distributed version of a Mobile Backbone Network Topology Synthesis Algorithm (MBN-TSA) for constructing and maintaining a dynamic backb...
Laura Huei-jiun Ju, Izhak Rubin
FLAIRS
2008
15 years 2 months ago
Learning Dynamic Naive Bayesian Classifiers
Hidden Markov models are a powerful technique to model and classify temporal sequences, such as in speech and gesture recognition. However, defining these models is still an art: ...
Miriam Martínez, Luis Enrique Sucar