• 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 68
Next 10 →

Approximated curvature penalty in non-rigid registration using pairwise mrfs

by Ben Glocker, Nikos Komodakis, Nikos Paragios, Nassir Navab - IN: ISVC. VOLUME 5875-I. (2009) 3
"... Labeling of discrete Markov Random Fields (MRFs) has become an attractive approach for solving the problem of non-rigid image registration. Here, regularization plays an important role in order to obtain smooth deformations for the inherent ill-posed problem. Smoothness is achieved by penalizing th ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
the derivatives of the displacement field. However, efficient optimization strategies (based on iterative graph-cuts) are only available for first-order MRFs which contain cliques of size up to two. Higher-order cliques require graph modifications and insertion of auxiliary nodes, while pairwise interactions

Energy-Efficient Hierarchical Routing Protocol for Homogeneous Wireless Sensor Network

by Muhammad Sajjad Hussain , Dr , Md Abdul Mottalib
"... Abstract Wireless Sensor Networks (WSNs) have paved the way for a new horizon of monitoring and gathering information. One of the most decisive criteria for smooth operation of WSNs is the limited energy supply of the sensor nodes. Numerous elegant energy-efficient routing protocols have been propo ..."
Abstract - Add to MetaCart
Abstract Wireless Sensor Networks (WSNs) have paved the way for a new horizon of monitoring and gathering information. One of the most decisive criteria for smooth operation of WSNs is the limited energy supply of the sensor nodes. Numerous elegant energy-efficient routing protocols have been

4. TITLE AND SUBTITLE Collaborative Hierarchical Sparse Modeling

by Pablo Sprechmann, Ignacio Ramirez, Guillermo Sapiro, Yonina Eldar, Technion I. I. T , 2010
"... Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments ..."
Abstract - Add to MetaCart
Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Washington Headquarters Services, Directorate for Information Operations and Reports, 1215 Jefferson Davis Highway, Suite 1204, Arlington VA 22202-4302. Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number.

1C-HiLasso: A Collaborative Hierarchical Sparse Modeling Framework

by Pablo Sprechmann, Guillermo Sapiro, Yonina C. Eldar
"... Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is performed by solving an `1-regularized linear regression problem, commonly referred to as Lasso or Basis Pursuit. In this work we combine the sparsity-inducing property of the Lasso ..."
Abstract - Add to MetaCart
Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is performed by solving an `1-regularized linear regression problem, commonly referred to as Lasso or Basis Pursuit. In this work we combine the sparsity-inducing property

POUR L'OBTENTION DU GRADE DE DOCTEUR ÈS SCIENCES PAR

by Dominique Tschopp, Prof E. Telatar, Prof S. Diggavi, Prof M. Grossglauser, Prof J. -y, Le Boudec, Prof M. Mitzenmacher, Prof S. Shakkottai
"... 2010 to my wife, Joyce, and my family...- Résumé- ..."
Abstract - Add to MetaCart
2010 to my wife, Joyce, and my family...- Résumé-

A GPU Accelerated Aggregation Algebraic Multigrid Method

by unknown authors
"... We present an efficient, robust and fully GPU-accelerated aggregation-based al-gebraic multigrid preconditioning technique for the solution of large sparse linear systems. These linear systems arise from the discretization of elliptic PDEs. The method involves two stages, setup and solve. In the set ..."
Abstract - Add to MetaCart
-cycles) in the solve stage. An efficient combination of K-cycles and standard multigrid V-cycles is used as the preconditioner for Krylov iterative solvers such as generalized minimal residual and conjugate gradient. We compare the solver performance with other solvers based on smooth aggregation and classical

Using BubbleStorm Accepted Master-Thesis from Marcel Lucas

by Assessor Prof Alej, Ro P. Buchmann, Ph. D
"... Hiermit versichere ich, die vorliegende Master-Thesis ohne Hilfe Dritter nur mit den angegebenen Quellen und Hilfsmitteln angefertigt zu haben. Alle Stellen, die aus Quellen entnommen wurden, sind als solche kenntlich gemacht. Diese Arbeit hat in gleicher oder ähnlicher Form noch keiner Prüfungsbehö ..."
Abstract - Add to MetaCart
NVEs. The unstructured P2P system BubbleStorm offers flexible and scalable means and is therefore used as a fundamental base for the developed Pub/Sub system. As the evaluation of the subscription is performed

New Techniques for Geographic Routing

by Ben Wing, Ben Wing, Lup Leong, Lup Leong , 2006
"... As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing, but ..."
Abstract - Add to MetaCart
As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing

Routing and Broadcasting in Ad-Hoc Networks

by Der Philosophisch-naturwissenschaftlichen Fakultät, Der Universität Bern, Marc Heissenbüttel, Prof Dr, T. Braun, Der Philosophisch-naturwissenschaftlichen Fakultät, Der Universität Bern, Marc Heissenbüttel, Von Frutigen, Prof Dr, T. Braun
"... I would like to thank Prof. Dr. Torsten Braun, head of the Computer Network and Distributed Systems group (RVS), for supervising this work and for his insightful advises. Prof. Dr. Torsten Braun encouraged and motivated me to publish my research results and he provided me the opportunity to present ..."
Abstract - Add to MetaCart
I would like to thank Prof. Dr. Torsten Braun, head of the Computer Network and Distributed Systems group (RVS), for supervising this work and for his insightful advises. Prof. Dr. Torsten Braun encouraged and motivated me to publish my research results and he provided me the opportunity to present the work on various conferences, for which I thank him. I would also like to thank Prof. Dr. Roger Wattenhofer, responsible for the Koreferat of this work. Also, Prof. Dr. Oscar Nierstrasz who was willing to be the co-examinator of this work deserves many thanks. Many thanks go to my colleagues of the RVS group and of the IAM for our various interesting discussions about all kinds of topics and for making the institute a very pleasant and friendly place to work at. Special thanks go to David Steiner, Marc Steinemann, Matthias Scheidegger, Florian Baumgartner, Ruy De Oliveira, and Attila Weyland. There are many students who worked with me and helped a lot in developing and implementing. Among them I especially thankful to Thomas Bernoulli,

Flush: A Reliable Bulk Transport Protocol for Multihop Wireless Networks

by unknown authors
"... We present Flush, a reliable, high goodput bulk data trans-port protocol for wireless sensor networks. Flush provides end-to-end reliability, reduces transfer time, and adapts to time-varying network conditions. It achieves these proper-ties using end-to-end acknowledgments, implicit snooping of con ..."
Abstract - Add to MetaCart
We present Flush, a reliable, high goodput bulk data trans-port protocol for wireless sensor networks. Flush provides end-to-end reliability, reduces transfer time, and adapts to time-varying network conditions. It achieves these proper-ties using end-to-end acknowledgments, implicit snooping
Next 10 →
Results 1 - 10 of 68
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