Sciweavers

2192 search results - page 247 / 439
» Algorithms for Challenging Motif Problems
Sort
View
EMNLP
2011
14 years 3 months ago
Watermarking the Outputs of Structured Prediction with an application in Statistical Machine Translation
We propose a general method to watermark and probabilistically identify the structured outputs of machine learning algorithms. Our method is robust to local editing operations and...
Ashish Venugopal, Jakob Uszkoreit, David Talbot, F...
KDD
2007
ACM
153views Data Mining» more  KDD 2007»
16 years 4 months ago
Exploiting duality in summarization with deterministic guarantees
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
Panagiotis Karras, Dimitris Sacharidis, Nikos Mamo...
TELETRAFFIC
2007
Springer
15 years 10 months ago
Distributed Path Computation Without Transient Loops: An Intermediate Variables Approach
Abstract— Paths with loops, even transient ones, pose significant stability problems in high-speed networks. We present a new algorithm, named Distributed Path Computation with ...
Saikat Ray, Roch Guérin, Rute Sofia
ATAL
2003
Springer
15 years 9 months ago
Role allocation and reallocation in multiagent teams: towards a practical analysis
Despite the success of the BDI approach to agent teamwork, initial role allocation (i.e. deciding which agents to allocate to key roles in the team) and role reallocation upon fai...
Ranjit Nair, Milind Tambe, Stacy Marsella
NEUROSCIENCE
2001
Springer
15 years 8 months ago
Analysis and Synthesis of Agents That Learn from Distributed Dynamic Data Sources
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
Doina Caragea, Adrian Silvescu, Vasant Honavar