Sciweavers

417 search results - page 72 / 84
» Some Theory for Generalized Boosting Algorithms
Sort
View
CIKM
2005
Springer
14 years 1 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
UPP
2004
Springer
14 years 1 months ago
Bio-inspired Computing Paradigms (Natural Computing)
Abstract. This is just a glimpse to the fruitful and constant preoccupation of computer science to try to get inspired by biology, at various levels. Besides briefly discussing th...
Gheorghe Paun
ICFP
2007
ACM
14 years 7 months ago
A type system for recursive modules
There has been much work in recent years on extending ML with recursive modules. One of the most difficult problems in the development of such an extension is the double vision pr...
Derek Dreyer
PODC
2005
ACM
14 years 1 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
EUSFLAT
2009
146views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
Opposite Fuzzy Sets with Applications in Image Processing
Diverse forms of the concept of opposition are already existent in philosophy, linguistics, psychology and physics. The interplay between entities and opposite entities is apparent...
Hamid R. Tizhoosh