Sciweavers

6943 search results - page 1105 / 1389
» Representations for evolutionary algorithms
Sort
View
WWW
2004
ACM
16 years 7 months ago
Web data integration using approximate string join
Web data integration is an important preprocessing step for web mining. It is highly likely that several records on the web whose textual representations differ may represent the ...
Yingping Huang, Gregory R. Madey
WWW
2004
ACM
16 years 7 months ago
XML data mediator integrated solution for xml roundtrip from xml to relational
This paper presents a system for efficient data transformations between XML and relational databases, called XML Data Mediator (XDM). XDM enables the transformation by externalizi...
Nianjun Zhou, George A. Mihaila, Dikran S. Melikse...
ESORICS
2009
Springer
16 years 7 months ago
Secure Evaluation of Private Linear Branching Programs with Medical Applications
Abstract. Diagnostic and classification algorithms play an important role in data analysis, with applications in areas such as health care, fault diagnostics, or benchmarking. Bran...
Mauro Barni, Pierluigi Failla, Vladimir Kolesnikov...
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
16 years 7 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 7 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
« Prev « First page 1105 / 1389 Last » Next »