Sciweavers

2173 search results - page 294 / 435
» Building computer models from small pieces
Sort
View
SMA
2005
ACM
119views Solid Modeling» more  SMA 2005»
15 years 10 months ago
Tightening: curvature-limiting morphological simplification
Given a planar set S of arbitrary topology and a radius r, we show how to construct an r-tightening of S, which is a set whose boundary has a radius of curvature everywhere greate...
Jason Williams, Jarek Rossignac
126
Voted
CODES
1998
IEEE
15 years 9 months ago
Schedulability analysis of heterogeneous systems for performance message sequence chart
Telecommunication systems are often specified in the standardized languages SDL and MSc. These languages allow only the specification of pure functional aspects. To remedy this pr...
Frank Slomka, Jürgen Zant, Lennard Lambert
156
Voted
DEXAW
2004
IEEE
88views Database» more  DEXAW 2004»
15 years 8 months ago
A Possible World Approach to Uncertain Relational Data
Data exchange between embedded systems and other small or large computing devices increases. Since data in different data sources may refer to the same real world objects, data ca...
Ander de Keijzer, Maurice van Keulen
157
Voted
SDM
2012
SIAM
235views Data Mining» more  SDM 2012»
13 years 7 months ago
Sampling Strategies to Evaluate the Performance of Unknown Predictors
The focus of this paper is on how to select a small sample of examples for labeling that can help us to evaluate many different classification models unknown at the time of sampl...
Hamed Valizadegan, Saeed Amizadeh, Milos Hauskrech...
COLT
2001
Springer
15 years 9 months ago
On Learning Monotone DNF under Product Distributions
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...
Rocco A. Servedio