4850 search results - page 55 / 970 » Approximate Data Structures with Applications |
133
Voted
EMNLP
2011
14 years 9 days ago
2011
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...
121
Voted
SIBGRAPI
2008
IEEE
15 years 7 months ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
100
Voted
RECOMB
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. Given the substantial computational requirements of stochastic simulation, approximation is essential for efficient analysis of any realistic biochemical system. This pap...
187
Voted
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
117
Voted
AISADM
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We present CoLe, a model for cooperative agents for mining knowledge from heterogeneous data. CoLe allows for the cooperation of different mining agents and the combinat...