Sciweavers

2563 search results - page 106 / 513
» Phenomenology, Representations and Complexity
Sort
View
ICDT
2009
ACM
166views Database» more  ICDT 2009»
15 years 10 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
KDD
2006
ACM
272views Data Mining» more  KDD 2006»
15 years 10 months ago
YALE: rapid prototyping for complex data mining tasks
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
Ingo Mierswa, Michael Wurst, Ralf Klinkenberg, Mar...
CGI
1998
IEEE
15 years 2 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
MKWI
2008
190views Business» more  MKWI 2008»
14 years 11 months ago
Partial Matchmaking for complex Product and Service Descriptions
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
Heiner Stuckenschmidt, Martin Kolb
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
15 years 10 months ago
Camouflaged fraud detection in domains with complex relationships
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
Sankar Virdhagriswaran, Gordon Dakin