Sciweavers

229 search results - page 30 / 46
» How Efficient Can Memory Checking Be
Sort
View
KDD
2006
ACM
160views Data Mining» more  KDD 2006»
14 years 8 months ago
Coherent closed quasi-clique discovery from large dense graph databases
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Ka...
ICCV
2007
IEEE
14 years 9 months ago
Globally Optimal Image Segmentation with an Elastic Shape Prior
So far global optimization techniques have been developed independently for the tasks of shape matching and image segmentation. In this paper we show that both tasks can in fact b...
Thomas Schoenemann, Daniel Cremers
CIDR
2009
152views Algorithms» more  CIDR 2009»
13 years 8 months ago
Visualizing the robustness of query execution
In database query processing, actual run-time conditions (e.g., actual selectivities and actual available memory) very often differ from compile-time expectations of run-time cond...
Goetz Graefe, Harumi A. Kuno, Janet L. Wiener
GECCO
2008
Springer
144views Optimization» more  GECCO 2008»
13 years 8 months ago
Multi-resistant radar jamming using genetic algorithms
The next generation of advanced self-protection jammers is expected to deliver effective and energy efficient jamming against modern air tracking radars. However, optimizing such ...
Hans Jonas Fossum Moen, Stein Kristoffersen
ICTAI
2008
IEEE
14 years 2 months ago
Real-Time Classification of Streaming Sensor Data
The last decade has seen a huge interest in classification of time series. Most of this work assumes that the data resides in main memory and is processed offline. However, recent...
Shashwati Kasetty, Candice Stafford, Gregory P. Wa...