Sciweavers

5350 search results - page 329 / 1070
» Space and time in eco-ontologies
Sort
View
CADE
2002
Springer
16 years 7 months ago
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
Eugene Goldberg
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
16 years 1 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
LCPC
2007
Springer
16 years 28 days ago
Evaluation of RDMA Opportunities in an Object-Oriented DSM
Remote Direct Memory Access (RDMA) is a technology to update a remote machine’s memory without intervention at the receiver side. We evaluate where RDMA can be usefully applied a...
Ronald Veldema, Michael Philippsen
HICSS
2006
IEEE
124views Biometrics» more  HICSS 2006»
16 years 26 days ago
A Bridge Home: The Use of the Internet by Transnational Communities of Immigrants
For decades transnational communities of immigrants have used various forms of communication to maintain ties with their places of origin. The Internet constitutes an alternative ...
Celene Navarrete, Esperanza Huerta
SAC
2006
ACM
16 years 23 days ago
A scalable algorithm for high-quality clustering of web snippets
We consider the problem of partitioning, in a highly accurate and highly efficient way, a set of n documents lying in a metric space into k non-overlapping clusters. We augment th...
Filippo Geraci, Marco Pellegrini, Paolo Pisati, Fa...