Sciweavers

1399 search results - page 77 / 280
» New Algorithms for k-Center and Extensions
Sort
View
AINA
2007
IEEE
14 years 1 months ago
Improving distributed join efficiency with extended bloom filter operations
Bloom filter based algorithms have proven successful as very efficient technique to reduce communication costs of database joins in a distributed setting. However, the full potent...
Loizos Michael, Wolfgang Nejdl, Odysseas Papapetro...
PSSS
2003
13 years 10 months ago
Extending Classical Theorem Proving for the Semantic Web
We investigate the applicability of classical resolution-based theorem proving methods for the Semantic Web. We consider several well-known search strategies, propose a general sch...
Tanel Tammet
WEA
2010
Springer
243views Algorithms» more  WEA 2010»
14 years 3 months ago
Experiments with a Feasibility Pump Approach for Nonconvex MINLPs
We present a new Feasibility Pump algorithm tailored for nonconvex Mixed Integer Nonlinear Programming problems. Differences with the previously proposed Feasibility Pump algorith...
Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti...
VRST
2000
ACM
14 years 1 months ago
Fast perception-based depth of field rendering
Current algorithms to create depth of field (DOF) effects are either too costly to be applied in VR systems, or they produce inaccurate results. In this paper, we present a new a...
Jurriaan D. Mulder, Robert van Liere
ICML
2010
IEEE
13 years 10 months ago
One-sided Support Vector Regression for Multiclass Cost-sensitive Classification
We propose a novel approach that reduces cost-sensitive classification to one-sided regression. The approach stores the cost information in the regression labels and encodes the m...
Han-Hsing Tu, Hsuan-Tien Lin