Sciweavers

420 search results - page 32 / 84
» Search on High Degree Graphs
Sort
View
114
Voted
MICRO
2008
IEEE
146views Hardware» more  MICRO 2008»
15 years 20 days ago
A small cache of large ranges: Hardware methods for efficiently searching, storing, and updating big dataflow tags
Dynamically tracking the flow of data within a microprocessor creates many new opportunities to detect and track malicious or erroneous behavior, but these schemes all rely on the...
Mohit Tiwari, Banit Agrawal, Shashidhar Mysore, Jo...
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
15 years 1 months ago
A study of NK landscapes' basins and local optima networks
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
Gabriela Ochoa, Marco Tomassini, Sébastien ...
120
Voted
AINA
2010
IEEE
15 years 5 months ago
Extracting Named Entities and Synonyms from Wikipedia
—In many search domains, both contents and searches are frequently tied to named entities such as a person, a company or similar. An example of such a domain is a news archive. O...
Christian Bohn, Kjetil Nørvåg
109
Voted
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
15 years 6 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
199
Voted
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
16 years 26 days ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...