Sciweavers

9842 search results - page 1825 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
SCALESPACE
2005
Springer
14 years 3 months ago
Texture Mapping via Spherical Multi-dimensional Scaling
Abstract. We present a technique for texture mapping arbitrary sphere-like surfaces with minimal distortions by spherical embedding. The embedding is computed using spherical multi...
Asi Elad (Elbaz), Yosi Keller, Ron Kimmel
SEMWEB
2005
Springer
14 years 3 months ago
On the Properties of Metamodeling in OWL
A common practice in conceptual modeling is to separate the conceptual from the data model. Although very intuitive, this approach is inadequate for many complex domains, in which...
Boris Motik
STACS
2005
Springer
14 years 3 months ago
Roundings Respecting Hard Constraints
We provide a deterministic algorithm that constructs small point sets exhibiting a low star discrepancy. The algorithm is based on recent results on randomized roundings respectin...
Benjamin Doerr
UML
2005
Springer
14 years 3 months ago
Modeling Crosscutting Services with UML Sequence Diagrams
Abstract. Current software systems increasingly consist of distributed interacting components. The use of web services and similar middleware technologies strongly fosters such arc...
Martin Deubler, Michael Meisinger, Sabine Rittmann...
VLDB
2005
ACM
118views Database» more  VLDB 2005»
14 years 3 months ago
Mining Compressed Frequent-Pattern Sets
A major challenge in frequent-pattern mining is the sheer size of its mining results. In many cases, a high min sup threshold may discover only commonsense patterns but a low one ...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
« Prev « First page 1825 / 1969 Last » Next »