Sciweavers

3244 search results - page 341 / 649
» On convex complexity measures
Sort
View
TKDE
2008
121views more  TKDE 2008»
15 years 6 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
TOG
2008
116views more  TOG 2008»
15 years 6 months ago
A photometric approach for estimating normals and tangents
This paper presents a technique for acquiring the shape of realworld objects with complex isotropic and anisotropic reflectance. Our method estimates the local normal and tangent ...
Michael Holroyd, Jason Lawrence, Greg Humphreys, T...
CCR
2002
111views more  CCR 2002»
15 years 6 months ago
A taxonomy and design considerations for Internet accounting
Economic principles are increasingly being suggested for addressing some complex issues related to distributed resource allocation for QoS (Quality of Service) enhancement. Many p...
Michel Kouadio, Udo W. Pooch
IPL
2002
65views more  IPL 2002»
15 years 6 months ago
Parallel evolutionary algorithms can achieve super-linear performance
One of the main reasons for using parallel evolutionary algorithms (PEAs) is to obtain efficient algorithms with an execution time much lower than that of their sequential counter...
Enrique Alba
GRAMMARS
1998
111views more  GRAMMARS 1998»
15 years 6 months ago
Quantitative Comparison of Languages
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...
András Kornai