Sciweavers

939 search results - page 179 / 188
» A Case for Polyscopic Structuring of Information
Sort
View
AUSAI
2007
Springer
14 years 1 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
CASES
2006
ACM
14 years 1 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
SMA
2006
ACM
101views Solid Modeling» more  SMA 2006»
14 years 1 months ago
A higher dimensional formulation for robust and interactive distance queries
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
Joon-Kyung Seong, David E. Johnson, Elaine Cohen
CINQ
2004
Springer
189views Database» more  CINQ 2004»
14 years 27 days ago
Employing Inductive Databases in Concrete Applications
In this paper we present the application of the inductive database approach to two practical analytical case studies: Web usage mining in Web logs and financial data. As far as co...
Rosa Meo, Pier Luca Lanzi, Maristella Matera, Dani...
IFIP
2004
Springer
14 years 26 days ago
New-HOPLA: A Higher-order Process Language with Name Generation
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...
Glynn Winskel, Francesco Zappa Nardelli