Sciweavers

1068 search results - page 151 / 214
» On Space Bounded Server Algorithms
Sort
View
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
14 years 5 days ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
11 years 10 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
GLOBECOM
2007
IEEE
14 years 2 months ago
A Geometric Approach to Slot Alignment in Wireless Sensor Networks
— Traditionally, slotted communication protocols have employed guard times to delineate and align slots. These guard times may expand the slot duration significantly, especially...
Niky Riga, Ibrahim Matta, Azer Bestavros
ICANN
2005
Springer
14 years 1 months ago
The LCCP for Optimizing Kernel Parameters for SVM
Abstract. Tuning hyper-parameters is a necessary step to improve learning algorithm performances. For Support Vector Machine classifiers, adjusting kernel parameters increases dra...
Sabri Boughorbel, Jean-Philippe Tarel, Nozha Bouje...
MMM
2003
Springer
258views Multimedia» more  MMM 2003»
14 years 1 months ago
2D Shape Transformation Using 3D Blending
Computer animation is one of the key components of a multimedia document or presentation. Shape transformation between objects of different topology and positions is an open model...
Galina Pasko, Alexander A. Pasko, M. Ikeda, Tosiya...