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

CiteSeerX logo

Advanced Search Include Citations

Tools

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

Space-time Interest Points

by Ivan Laptev, Tony Lindeberg - IN ICCV , 2003
"... Local image features or interest points provide compact and abstract representations of patterns in an image. In this paper, we propose to extend the notion of spatial interest points into the spatio-temporal domain and show how the resulting features often reflect interesting events that can be use ..."
Abstract - Cited by 819 (21 self) - Add to MetaCart
Local image features or interest points provide compact and abstract representations of patterns in an image. In this paper, we propose to extend the notion of spatial interest points into the spatio-temporal domain and show how the resulting features often reflect interesting events that can

A theory of timed automata

by Rajeev Alur , 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract - Cited by 2651 (32 self) - Add to MetaCart
using finitely many real-valued clock variables. Automated analysis of timed automata relies on the construction of a finite quotient of the infinite space of clock valuations. Over the years, the formalism has been extensively studied leading to many results establishing connections to circuits

Panel Cointegration; Asymptotic and Finite Sample Properties of Pooled Time Series Tests, With an Application to the PPP Hypothesis; New Results. Working paper

by Peter Pedroni , 1997
"... We examine properties of residual-based tests for the null of no cointegration for dynamic panels in which both the short-run dynamics and the long-run slope coefficients are permitted to be heterogeneous across individual members of the panel+ The tests also allow for individual heterogeneous fixed ..."
Abstract - Cited by 529 (13 self) - Add to MetaCart
We examine properties of residual-based tests for the null of no cointegration for dynamic panels in which both the short-run dynamics and the long-run slope coefficients are permitted to be heterogeneous across individual members of the panel+ The tests also allow for individual heterogeneous fixed effects and trend terms, and we consider both pooled within dimension tests and group mean between dimension tests+ We derive limiting distributions for these and show that they are normal and free of nuisance parameters+ We also provide Monte Carlo evidence to demonstrate their small sample size and power performance, and we illustrate their use in testing purchasing power parity for the post–Bretton Woods period+ 1.

Robust real-time face detection

by Paul Viola, Michael Jones - International Journal of Computer Vision , 2004
"... We have constructed a frontal face detection system which achieves detection and false positive rates which are equivalent to the best published results [7, 5, 6, 4, 1]. This face detection system is most clearly distinguished from previous approaches in its ability to detect faces extremely rapidly ..."
Abstract - Cited by 1888 (9 self) - Add to MetaCart
We have constructed a frontal face detection system which achieves detection and false positive rates which are equivalent to the best published results [7, 5, 6, 4, 1]. This face detection system is most clearly distinguished from previous approaches in its ability to detect faces extremely

Fast subsequence matching in time-series databases

by Christos Faloutsos, M. Ranganathan, Yannis Manolopoulos - PROCEEDINGS OF THE 1994 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA , 1994
"... We present an efficient indexing method to locate 1-dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to map each data sequence into a small set of multidimensional rectangles in feature space ..."
Abstract - Cited by 533 (24 self) - Add to MetaCart
compared the method to sequential scanning, which is the only obvious competitor. The results were excellent: our method accelerated the search time from 3 times up to 100 times.

Symbolic Model Checking for Real-time Systems

by Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, Sergio Yovine - INFORMATION AND COMPUTATION , 1992
"... We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an ..."
Abstract - Cited by 578 (50 self) - Add to MetaCart
, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed -calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does

Points-to Analysis in Almost Linear Time

by Bjarne Steensgaard , 1996
"... We present an interprocedural flow-insensitive points-to analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest non-trivial interprocedural points-to analysis algorithm yet described. The algorithm is based on a non-s ..."
Abstract - Cited by 595 (3 self) - Add to MetaCart
We present an interprocedural flow-insensitive points-to analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest non-trivial interprocedural points-to analysis algorithm yet described. The algorithm is based on a non

Consensus Problems in Networks of Agents with Switching Topology and Time-Delays

by Reza Olfati Saber, Richard M. Murray , 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no time-delays, ii) networks with fixed topology and communication time-delays, and iii) max-consensus problems (or leader ..."
Abstract - Cited by 1112 (21 self) - Add to MetaCart
In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no time-delays, ii) networks with fixed topology and communication time-delays, and iii) max-consensus problems (or

Real-time human pose recognition in parts from single depth images

by Jamie Shotton, Andrew Fitzgibbon, Mat Cook, Toby Sharp, Mark Finocchio, Richard Moore, Alex Kipman, Andrew Blake - IN CVPR , 2011
"... We propose a new method to quickly and accurately predict 3D positions of body joints from a single depth image, using no temporal information. We take an object recognition approach, designing an intermediate body parts representation that maps the difficult pose estimation problem into a simpler p ..."
Abstract - Cited by 568 (17 self) - Add to MetaCart
per-pixel classification problem. Our large and highly varied training dataset allows the classifier to estimate body parts invariant to pose, body shape, clothing, etc. Finally we generate confidence-scored 3D proposals of several body joints by reprojecting the classification result and finding

Space-time codes for high data rate wireless communication: Performance criterion and code construction

by Vahid Tarokh, Nambi Seshadri, A. R. Calderbank - IEEE TRANS. INFORM. THEORY , 1998
"... We consider the design of channel codes for improving the data rate and/or the reliability of communications over fading channels using multiple transmit antennas. Data is encoded by a channel code and the encoded data is split into n streams that are simultaneously transmitted using n transmit ant ..."
Abstract - Cited by 1782 (28 self) - Add to MetaCart
constructed from pairs of distinct code sequences. The minimum rank among these matrices quantifies the diversity gain, while the minimum determinant of these matrices quantifies the coding gain. The results are then extended to fast fading channels. The design criteria are used to design trellis codes
Next 10 →
Results 1 - 10 of 372,968
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