Sciweavers

473 search results - page 59 / 95
» Volume scene graphs
Sort
View
PAMI
2010
139views more  PAMI 2010»
14 years 8 months ago
Order-Preserving Moves for Graph-Cut-Based Optimization
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
Xiaoqing Liu, Olga Veksler, Jagath Samarabandu
OWLED
2007
14 years 11 months ago
Use of OWL for Describing Stream Processing Components to Enable Automatic Composition
Stream Processing Applications analyze large volumes of streaming data in real-time. These applications, consist of data sources, which produce raw streams, and processing elements...
Zhen Liu, Anand Ranganathan, Anton Riabov
IPPS
2010
IEEE
14 years 7 months ago
Large scale complex network analysis using the hybrid combination of a MapReduce cluster and a highly multithreaded system
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
Seunghwa Kang, David A. Bader
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
15 years 6 months ago
Near-optimal Supervised Feature Selection among Frequent Subgraphs.
Graph classification is an increasingly important step in numerous application domains, such as function prediction of molecules and proteins, computerised scene analysis, and an...
Alexander J. Smola, Arthur Gretton, Hans-Peter Kri...
ACMICEC
2007
ACM
245views ECommerce» more  ACMICEC 2007»
15 years 1 months ago
Keyword generation for search engine advertising using semantic similarity between terms
An important problem in search engine advertising is keyword1 generation. In the past, advertisers have preferred to bid for keywords that tend to have high search volumes and hen...
Vibhanshu Abhishek, Kartik Hosanagar