Sciweavers

2036 search results - page 65 / 408
» From Sampling to Model Counting
Sort
View
176
Voted
AAAI
2007
15 years 8 months ago
Learning by Combining Observations and User Edits
We introduce a new collaborative machine learning paradigm in which the user directs a learning algorithm by manually editing the automatically induced model. We identify a generi...
Vittorio Castelli, Lawrence D. Bergman, Daniel Obl...
284
Voted
NLP
2000
15 years 9 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
188
Voted
MIDDLEWARE
2004
Springer
15 years 11 months ago
The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations
In recent years, the gossip-based communication model in large-scale distributed systems has become a general paradigm with important applications which include information dissemi...
Márk Jelasity, Rachid Guerraoui, Anne-Marie...
CCR
2008
118views more  CCR 2008»
15 years 6 months ago
A generic language for application-specific flow sampling
Flow records gathered by routers provide valuable coarse-granularity traffic information for several measurement-related network applications. However, due to high volumes of traf...
Harsha V. Madhyastha, Balachander Krishnamurthy
ALT
1997
Springer
15 years 10 months ago
Learning DFA from Simple Examples
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
Rajesh Parekh, Vasant Honavar