Sciweavers

10602 search results - page 2083 / 2121
» Weakly Useful Sequences
Sort
View
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 6 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
BIRTHDAY
2008
Springer
15 years 6 months ago
SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets
Abstract. Starting from existing spreadsheet software, like Lotus 1-23R , ExcelR , or Spreadsheet 2000R , we propose a sequence of enhancements to fully integrate constraint-based ...
Nachum Dershowitz, Claude Kirchner
CCS
2008
ACM
15 years 6 months ago
Privacy oracle: a system for finding application leaks with black box differential testing
We describe the design and implementation of Privacy Oracle, a system that reports on application leaks of user information via the network traffic that they send. Privacy Oracle ...
Jaeyeon Jung, Anmol Sheth, Ben Greenstein, David W...
CANDC
2005
ACM
15 years 6 months ago
The development of a cybernetic sculptor: Edward Ihnatowicz and the senster
Edward Ihnatowicz (1926-1988) built one of the world’s first computer-controlled robotic sculptures, The Senster, in 196870. Rather than concentrate entirely on this groundbreak...
Aleksandar Zivanovic
HYBRID
2010
Springer
15 years 6 months ago
Receding horizon control for temporal logic specifications
In this paper, we describe a receding horizon scheme that satisfies a class of linear temporal logic specifications sufficient to describe a wide range of properties including saf...
Tichakorn Wongpiromsarn, Ufuk Topcu, Richard M. Mu...
« Prev « First page 2083 / 2121 Last » Next »