Sciweavers

3319 search results - page 515 / 664
» Type Theoretical Databases
Sort
View
147
Voted
MFCS
2004
Springer
15 years 10 months ago
Complexity of Decision Problems for Simple Regular Expressions
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
Wim Martens, Frank Neven, Thomas Schwentick
PAKDD
2004
ACM
127views Data Mining» more  PAKDD 2004»
15 years 10 months ago
Separating Structure from Interestingness
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
MICRO
2003
IEEE
124views Hardware» more  MICRO 2003»
15 years 10 months ago
Optimum Power/Performance Pipeline Depth
The impact of pipeline length on both the power and performance of a microprocessor is explored both theoretically and by simulation. A theory is presented for a wide range of pow...
Allan Hartstein, Thomas R. Puzak
ISCA
2002
IEEE
127views Hardware» more  ISCA 2002»
15 years 9 months ago
The Optimum Pipeline Depth for a Microprocessor
The impact of pipeline length on the performance of a microprocessor is explored both theoretically and by simulation. An analytical theory is presented that shows two opposing ar...
Allan Hartstein, Thomas R. Puzak
ECCV
2010
Springer
15 years 9 months ago
Partition Min-Hash for Partial Duplicate Image Discovery
In this paper, we propose Partition min-Hash (PmH), a novel hashing scheme for discovering partial duplicate images from a large database. Unlike the standard min-Hash algorithm th...