Sciweavers

939 search results - page 13 / 188
» A Case for Polyscopic Structuring of Information
Sort
View
DAM
2006
102views more  DAM 2006»
13 years 7 months ago
Secret sharing schemes on access structures with intersection number equal to one
The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. These problems are studied ...
Jaume Martí-Farré, Carles Padr&oacut...
AAAI
2008
13 years 9 months ago
Linking Social Networks on the Web with FOAF: A Semantic Web Case Study
One of the core goals of the Semantic Web is to store data in distributed locations, and use ontologies and reasoning to aggregate it. Social networking is a large movement on the...
Jennifer Golbeck, Matthew Rothstein
DEBU
2008
104views more  DEBU 2008»
13 years 7 months ago
Process Mining in Web Services: The WebSphere Case
Process mining has emerged as a way to discover or check the conformance of processes based on event logs. This enables organizations to learn from processes as they really take p...
Wil M. P. van der Aalst, H. M. W. (Eric) Verbeek
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
13 years 11 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
BIODATAMINING
2008
117views more  BIODATAMINING 2008»
13 years 7 months ago
Search extension transforms Wiki into a relational system: A case for flavonoid metabolite database
Background: In computer science, database systems are based on the relational model founded by Edgar Codd in 1970. On the other hand, in the area of biology the word 'databas...
Masanori Arita, Kazuhiro Suwa