Sciweavers

12194 search results - page 2137 / 2439
» Numberings Optimal for Learning
Sort
View
DLOG
2006
15 years 8 months ago
Data Complexity of Answering Unions of Conjunctive Queries in SHIQ
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
FAST
2004
15 years 8 months ago
Diamond: A Storage Architecture for Early Discard in Interactive Search
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...
Larry Huston, Rahul Sukthankar, Rajiv Wickremesing...
ICISC
2004
96views Cryptology» more  ICISC 2004»
15 years 8 months ago
Efficient Broadcast Encryption Using Multiple Interpolation Methods
We propose a new broadcast encryption scheme based on polynomial interpolations. Our scheme, obtained from the Naor-Pinkas scheme by partitioning the user set and interpolating mul...
Eun Sun Yoo, Nam-Su Jho, Jung Hee Cheon, Myung-Hwa...
CAINE
2003
15 years 8 months ago
Semi Greedy Algorithm for Finding Connectivity in Microchip Physical Layouts
Scan based or Line Sweep methods are a traditional mechanism to traverse the physical layout, or artwork of a microchip. These traversals are incremental in nature. They typically...
Clemente Izurieta
ICWN
2004
15 years 8 months ago
Efficient Minimum-Cost Bandwidth-Constrained Routing in Wireless Sensor Networks
A critical issue in the design of routing protocols for wireless sensor networks is the efficient utilization of resources such as scarce bandwidth and limited energy supply. Many ...
Maulin Patel, R. Chandrasekaran, S. Venkatesan
« Prev « First page 2137 / 2439 Last » Next »