Sciweavers

304 search results - page 18 / 61
» Dynamic ordered sets with exponential search trees
Sort
View
JCIT
2008
138views more  JCIT 2008»
13 years 8 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan
BMCBI
2007
143views more  BMCBI 2007»
13 years 8 months ago
An adaptive bin framework search method for a beta-sheet protein homopolymer model
Background: The problem of protein structure prediction consists of predicting the functional or native structure of a protein given its linear sequence of amino acids. This probl...
Alena Shmygelska, Holger H. Hoos
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
14 years 27 days ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
14 years 9 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
ACNS
2004
Springer
220views Cryptology» more  ACNS 2004»
14 years 2 months ago
Secure Conjunctive Keyword Search over Encrypted Data
Abstract. We study the setting in which a user stores encrypted documents (e.g. e-mails) on an untrusted server. In order to retrieve documents satisfying a certain search criterio...
Philippe Golle, Jessica Staddon, Brent R. Waters