Sciweavers

1629 search results - page 262 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
CIKM
2008
Springer
14 years 12 months ago
Large-scale, parallel automatic patent annotation
When researching new product ideas or filing new patents, inventors need to retrieve all relevant pre-existing know-how and/or to exploit and enforce patents in their technologica...
Milan Agatonovic, Niraj Aswani, Kalina Bontcheva, ...
FGCS
2008
140views more  FGCS 2008»
14 years 10 months ago
Allocation strategies for utilization of space-shared resources in Bag of Tasks grids
As the adoption of grid computing in organizations expands, the need for wise utilization of different types of resources also increases. A volatile resource, such as a desktop co...
César A. F. De Rose, Tiago C. Ferreto, Rodr...
CIVR
2007
Springer
192views Image Analysis» more  CIVR 2007»
15 years 4 months ago
Texture retrieval based on a non-parametric measure for multivariate distributions
In the present study, an efficient strategy for retrieving texture images from large texture databases is introduced and studied within a distributional-statistical framework. Our...
Vasileios K. Pothos, Christos Theoharatos, George ...
VLSISP
2008
100views more  VLSISP 2008»
14 years 9 months ago
Memory-constrained Block Processing for DSP Software Optimization
Digital signal processing (DSP) applications involve processing long streams of input data. It is important to take into account this form of processing when implementing embedded ...
Ming-Yung Ko, Chung-Ching Shen, Shuvra S. Bhattach...
ICPR
2008
IEEE
15 years 4 months ago
Incremental clustering via nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Serhat Selcuk Bucak, Bilge Günsel