4850 search results - page 55 / 970 » Approximate Data Structures with Applications |
104
click to vote
EMNLP
2011
13 years 9 months 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...
104
click to vote
SIBGRAPI
2008
IEEE
15 years 4 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...
RECOMB
2007
Springer
15 years 10 months 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...
155
click to vote
ICDE
2008
IEEE
15 years 11 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...
AISADM
2005
Springer
15 years 3 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...