Sciweavers

11565 search results - page 2150 / 2313
» Computing Minimal Mappings
Sort
View
ICFCA
2007
Springer
14 years 3 months ago
A Parameterized Algorithm for Exploring Concept Lattices
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (...
Peggy Cellier, Sébastien Ferré, Oliv...
ICS
2007
Tsinghua U.
14 years 3 months ago
Performance driven data cache prefetching in a dynamic software optimization system
Software or hardware data cache prefetching is an efficient way to hide cache miss latency. However effectiveness of the issued prefetches have to be monitored in order to maximi...
Jean Christophe Beyler, Philippe Clauss
IPSN
2007
Springer
14 years 3 months ago
Robust message-passing for statistical inference in sensor networks
Large-scale sensor network applications require in-network processing and data fusion to compute statistically relevant summaries of the sensed measurements. This paper studies di...
Jeremy Schiff, Dominic Antonelli, Alexandros G. Di...
LSSC
2007
Springer
14 years 3 months ago
Bridging Methods for Coupling Atomistic and Continuum Models
Abstract. We review some recent developments in the coupling of atomistic and continuum models based on the blending of the two models in a bridge region connecting the other two r...
Santiago Badia, Pavel B. Bochev, Max Gunzburger, R...
PSIVT
2007
Springer
203views Multimedia» more  PSIVT 2007»
14 years 3 months ago
Direct Ellipse Fitting and Measuring Based on Shape Boundaries
: Measuring ellipticity is an important area of computer vision systems. Most existing ellipticity measures are area based and cannot be easily applied to point sets such as extrac...
Milos Stojmenovic, Amiya Nayak
« Prev « First page 2150 / 2313 Last » Next »