• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 1,192,809
Next 10 →

Efficient symbolic multi-objective design space exploration

by Martin Lukasiewycz, Michael Glaß, Christian Haubelt - In Proc. of ASP-DAC ’08 , 2008
"... Abstract — Nowadays many design space exploration tools are ..."
Abstract - Cited by 13 (7 self) - Add to MetaCart
Abstract — Nowadays many design space exploration tools are

Efficient Symbolic Multi-Objective Design . . .

by Martin Lukasiewycz, Michael Glaß, Christian Haubelt, Jürgen Teich , 2008
"... Nowadays many design space exploration tools are ..."
Abstract - Add to MetaCart
Nowadays many design space exploration tools are

Symbolic Model Checking without BDDs

by Armin Biere , Alessandro Cimatti, Edmund Clarke, Yunshan Zhu , 1999
"... Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis ..."
Abstract - Cited by 910 (74 self) - Add to MetaCart
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis

Efficient similarity search in sequence databases

by Rakesh Agrawal, Christos Faloutsos, Arun Swami , 1994
"... We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation being that, for most sequences of practical interest, only the first few frequencies are strong. Anot ..."
Abstract - Cited by 505 (21 self) - Add to MetaCart
. Another important observation is Parseval's theorem, which specifies that the Fourier transform preserves the Euclidean distance in the time or frequency domain. Having thus mapped sequences to a lower-dimensionality space by using only the first few Fourier coe cients, we use R-trees to index

Efficient and Effective Querying by Image Content

by C. Faloutsos, W. Equitz, M. Flickner, W. Niblack, D. Petkovic, R. Barber - Journal of Intelligent Information Systems , 1994
"... In the QBIC (Query By Image Content) project we are studying methods to query large on-line image databases using the images' content as the basis of the queries. Examples of the content we use include color, texture, and shape of image objects and regions. Potential applications include med ..."
Abstract - Cited by 500 (13 self) - Add to MetaCart
In the QBIC (Query By Image Content) project we are studying methods to query large on-line image databases using the images' content as the basis of the queries. Examples of the content we use include color, texture, and shape of image objects and regions. Potential applications include

Implementing data cubes efficiently

by Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ulman - In SIGMOD , 1996
"... Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting of an aggregation of interest, like total ..."
Abstract - Cited by 545 (1 self) - Add to MetaCart
to materialize. The greedy algorithm performs within a small constant factor of optimal under a variety of models. We then consider the most common case of the hypercube lattice and examine the choice of materialized views for hypercubes in detail, giving some good tradeoffs between the space used

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 652 (38 self) - Add to MetaCart
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

Random Oracles are Practical: A Paradigm for Designing Efficient Protocols

by Mihir Bellare, Phillip Rogaway , 1995
"... We argue that the random oracle model -- where all parties have access to a public random oracle -- provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R for the ..."
Abstract - Cited by 1643 (75 self) - Add to MetaCart
for the random oracle model, and then replacing oracle accesses by the computation of an "appropriately chosen" function h. This paradigm yields protocols much more efficient than standard ones while retaining many of the advantages of provable security. We illustrate these gains for problems including

An Energy-Efficient MAC Protocol for Wireless Sensor Networks

by Wei Ye, John Heidemann, Deborah Estrin , 2002
"... This paper proposes S-MAC, a medium-access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use battery-operated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. We expect senso ..."
Abstract - Cited by 1488 (37 self) - Add to MetaCart
This paper proposes S-MAC, a medium-access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use battery-operated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. We expect

Designing Learning

by Ann C. Baker, Patricia J. Jensen, David A. Kolb, D. A. Conversational, Ann Baker, Patricia Jensen, David Kolb - In , 2004
"... …Truth [is] being involved in an eternal conversation about things that matter, conducted with passion and discipline…truth is not in the conclusions so much as in the process of conversation itself…if you want to be in truth you must be in conversation. Parker Palmer ..."
Abstract - Cited by 555 (9 self) - Add to MetaCart
…Truth [is] being involved in an eternal conversation about things that matter, conducted with passion and discipline…truth is not in the conclusions so much as in the process of conversation itself…if you want to be in truth you must be in conversation. Parker Palmer
Next 10 →
Results 1 - 10 of 1,192,809
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University