4850 search results - page 414 / 970 » Approximate Data Structures with Applications |
265
click to vote
ICDAR
2011
IEEE
14 years 7 months ago
2011
IEEE
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
220
click to vote
PODS
2006
ACM
16 years 7 months ago
2006
ACM
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
218
click to vote
LPNMR
2009
Springer
2009
Springer
Application of ASP for Automatic Synthesis of Flexible Multiprocessor Systems from Parallel Programs
16 years 2 months ago
Configurable on chip multiprocessor systems combine advantages of task-level parallelism and the flexibility of field-programmable devices to customize architectures for paralle...
206
Voted
IJFCS
2008
15 years 7 months ago
2008
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
160
click to vote
LOCA
2005
Springer
16 years 1 months ago
2005
Springer
Location-based services like reminders, electronic graffiti, and tourist guides normally require a custom, location-sensitive database that must be custom-tailored for the applicat...