Results 1 - 10 of 4,247

M-tree: An Efficient Access Method for Similarity Search in Metric Spaces

by Paolo Ciaccia, Marco Patella, Pavel Zezula , 1997
"... A new access meth d, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion o ..."
Abstract - Cited by 663 (38 self) - Add to MetaCart
of objects and split management, whF h keep th M-tree always balanced - severalheralvFV split alternatives are considered and experimentally evaluated. Algorithd for similarity (range and k-nearest neigh bors) queries are also described. Results from extensive experimentationwith a prototype system

Reschke Experimental [Page 2]

by Group J. Reschke, Status Of This Memo
"... This memo defines an Experimental Protocol for the Internet community. It does not specify an Internet standard of any kind. Discussion and suggestions for improvement are requested. Distribution of this memo is unlimited. Copyright Notice Copyright © The Internet Society (2005). All Rights Reserved ..."
Abstract - Add to MetaCart
This memo defines an Experimental Protocol for the Internet community. It does not specify an Internet standard of any kind. Discussion and suggestions for improvement are requested. Distribution of this memo is unlimited. Copyright Notice Copyright © The Internet Society (2005). All Rights

Index Experimental Pages 1-13 References from Experimental Page 14

by V. Adriaenssens, Carolyn A. Austin, Mairi Gibson, David Smith, Richard C, Ref No. O
"... Scanned spectra in numerical order Pages 15-27 Experimental All reactons under an inert atmosphere were carried out using oven dried or flame dried glassware. Solutions were added via syringe. THF was freshly distilled from sodium benzophenone. Dichloromethane, and triethyl phosphite were distilled ..."
Abstract - Add to MetaCart
Scanned spectra in numerical order Pages 15-27 Experimental All reactons under an inert atmosphere were carried out using oven dried or flame dried glassware. Solutions were added via syringe. THF was freshly distilled from sodium benzophenone. Dichloromethane, and triethyl phosphite were distilled

Discriminative probabilistic models for relational data

by Ben Taskar , 2002
"... In many supervised learning tasks, the entities to be labeled are related to each other in complex ways and their labels are not independent. For example, in hypertext classification, the labels of linked pages are highly correlated. A standard approach is to classify each entity independently, igno ..."
Abstract - Cited by 415 (12 self) - Add to MetaCart
In many supervised learning tasks, the entities to be labeled are related to each other in complex ways and their labels are not independent. For example, in hypertext classification, the labels of linked pages are highly correlated. A standard approach is to classify each entity independently

RoadRunner: Towards Automatic Data Extraction from Large Web Sites

by Valter Crescenzi, Giansalvatore Mecca, Paolo Merialdo , 2001
"... The paper investigates techniques for extracting data from HTML sites through the use of automatically generated wrappers. To automate the wrapper generation and the data extraction process, the paper develops a novel technique to compare HTML pages and generate a wrapper based on their similarities ..."
Abstract - Cited by 405 (9 self) - Add to MetaCart
The paper investigates techniques for extracting data from HTML sites through the use of automatically generated wrappers. To automate the wrapper generation and the data extraction process, the paper develops a novel technique to compare HTML pages and generate a wrapper based

Efficient Crawling Through URL Ordering

by Junghoo Cho, Hector Garcia-molina, Lawrence Page - COMPUTER NETWORKS AND ISDN SYSTEMS , 1998
"... In this paper we study in what order a crawler should visit the URLs it has seen, in order to obtain more “important” pages first. Obtaining important pages rapidly can be very useful when a crawler cannot visit the entire Web in a reasonable amount of time. We define several importance metrics, ord ..."
Abstract - Cited by 384 (9 self) - Add to MetaCart
, ordering schemes, and performance evaluation measures for this problem. We also experimentally evaluate the ordering schemes on the Stanford University Web. Our results show that a crawler with a good ordering scheme can obtain important pages significantly faster than one without.

WebWatcher: A Tour Guide for the World Wide Web

by Thorsten Joachims, Dayne Freitag, Tom Mitchell - PROCEEDINGS OF IJCAI97 , 1997
"... We explore the notion of a tour guide software agent for assisting users browsing the World Wide Web. A Web tour guide agent provides assistance similar to that provided by ahuman tour guide in a museum -- it guides the user along an appropriate path through the collection, based on its knowledge of ..."
Abstract - Cited by 359 (8 self) - Add to MetaCart
's School of Computer Science Web pages. WebWatcher accompanies users from page to page, suggests appropriate hyperlinks, and learns from experience to improve its advice-giving skills. We describe the learning algorithms used by WebWatcher, experimental results showing their effectiveness, and lessons

System Description: Twelf --- A Meta-Logical Framework for Deductive Systems

by Frank Pfenning, Carsten Schurmann - Proceedings of the 16th International Conference on Automated Deduction (CADE-16 , 1999
"... . Twelf is a meta-logical framework for the specification, implementation, and meta-theory of deductive systems from the theory of programming languages and logics. It relies on the LF type theory and the judgments-as-types methodology for specification [HHP93], a constraint logic programming interp ..."
Abstract - Cited by 357 (54 self) - Add to MetaCart
platforms. The current version (1.2) is distributed with a complete manual, example suites, a tutorial in the form of on-line lecture notes [Pfe], and an Emacs interface. Source and binary distributions are accessible via the Twelf home page http://www.cs.cmu.edu/~twelf. 1 The Twelf System The Twelf

Fbufs: A High-Bandwidth Cross-Domain Transfer Facility

by Peter Druschel, Larry L. Peterson - in Proceedings of the Fourteenth ACM symposium on Operating Systems Principles , 1993
"... We have designed and implemented a new operating system facility for I/O buffer management and data transfer across protection domain boundaries on shared memory machines. This facility, called fast buffers (fbufs), combines virtual page remapping with shared virtual memory, and exploits locality in ..."
Abstract - Cited by 332 (15 self) - Add to MetaCart
We have designed and implemented a new operating system facility for I/O buffer management and data transfer across protection domain boundaries on shared memory machines. This facility, called fast buffers (fbufs), combines virtual page remapping with shared virtual memory, and exploits locality

Escape analysis for Java

by Jong-deok Choi, Mannish Gupta, Mauricio Serrano, Vugranam C. Sreedhar, Sam Midkiff - OOPSLA , 1999
"... This paper presents a simple and efficient data flow algorithm for escape analysis of objects in Java programs to determine (i) if an object can be allocated on the stack; (ii) if an object is accessed only by a single thread duriing its lifetime, so that synchronization operations on that object ca ..."
Abstract - Cited by 300 (12 self) - Add to MetaCart
be used effectively in different calling contexts. We present an interprocedural al-gorithm that uses the above property to efficiently compute the connection graph and identify the non-escaping objects for methods and threads. The experimental results, from a proto-type implementation of our framework
Results 1 - 10 of 4,247