Sciweavers

1651 search results - page 143 / 331
» Measuring the Complexity of Classification Problems
Sort
View
TKDE
2008
121views more  TKDE 2008»
13 years 8 months ago
Schema Matching Using Interattribute Dependencies
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
Jaewoo Kang, Jeffrey F. Naughton
PR
2008
131views more  PR 2008»
13 years 8 months ago
A memetic algorithm for evolutionary prototype selection: A scaling up approach
Prototype selection problem consists of reducing the size of databases by removing samples that are considered noisy or not influential on nearest neighbour classification tasks. ...
Salvador García, José Ramón C...
EPEW
2006
Springer
13 years 11 months ago
Model Checking for a Class of Performance Properties of Fluid Stochastic Models
Abstract. Recently, there is an explosive development of fluid approaches to computer and distributed systems. These approaches are inherently stochastic and generate continuous st...
Manuela L. Bujorianu, Marius C. Bujorianu
VL
1993
IEEE
147views Visual Languages» more  VL 1993»
14 years 3 days ago
Fractal Approaches for Visualizing Huge Hierarchies
This paper describes fractal approaches to the problems which associate with visualizing huge hierarchies. The geometrical characteristic of a fractal, selfsimilarity, allows user...
Hideki Koike, Hirotaka Yoshihara
ECCC
2010
86views more  ECCC 2010»
13 years 8 months ago
On Approximating the Entropy of Polynomial Mappings
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P...