CORR 2006 - PDF Preprint Papers

CORR 2006 Workshop on Service Oriented Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CORR-2006 Paper

click to vote

CORR
2006
Springer

242views Education» more CORR 2006»

Matching Edges in Images ; Application to Face Recognition

13 years 4 months ago

Download users.polytech.unice.fr

: This communication describes a representation of images as a set of edges characterized by their position and orientation. This representation allows the comparison of two images...

Joël Le Roux, Philippe Chaurand, Mickael Urru...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	242	Matching Edges in Images ; Application to Face Recognition	claim
2	225	Building and displaying name relations using automatic unsupervised analysis of newspaper articles	claim
3	206	ANAP: Anonymous Authentication Protocol in Mobile Ad hoc Networks	claim
4	193	On the Design of Agent-Based Systems using UML and Extensions	claim
5	189	Node-Based Optimal Power Control, Routing, and Congestion Control in Wireless Networks	claim
6	186	SASE: Complex Event Processing over Streams	claim
7	182	Cryptanalysis of the CFVZ cryptosystem	claim
8	180	Social Networks and Social Information Filtering on Digg	claim
9	178	Low-rank matrix factorization with attributes	claim
10	178	A tool set for the quick and efficient exploration of large document collections	claim
11	176	On the Fingerprinting Capacity Under the Marking Assumption	claim
12	175	Adaptive Channel Allocation Spectrum Etiquette for Cognitive Radio Networks	claim
13	173	Analyzing Large Collections of Electronic Text Using OLAP	claim
14	172	Approximate Convex Optimization by Online Game Playing	claim
15	169	Concurrently Non-Malleable Zero Knowledge in the Authenticated Public-Key Model	claim
16	166	Bounding the Bias of Tree-Like Sampling in IP Topologies	claim
17	164	Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions	claim
18	163	Finding roots of polynomials over finite fields	claim
19	161	Consensus Propagation	claim
20	160	On Conditional Branches in Optimal Search Trees	claim
21	160	Frugality ratios and improved truthful mechanisms for vertex cover	claim
22	159	Structural Alignments of pseudo-knotted RNA-molecules in polynomial time	claim
23	158	Building a resource for studying translation shifts	claim
24	157	DSmT: A new paradigm shift for information fusion	claim
25	156	Complex Lattice Reduction Algorithm for Low-Complexity MIMO Detection	claim
26	155	Complexity and Philosophy	claim
27	154	Intra-site Level Cultural Heritage Documentation: Combination of Survey, Modeling and Imagery Data in a Web Information System	claim
28	154	Functional Bregman Divergence and Bayesian Estimation of Distributions	claim
29	154	How Hard Is Bribery in Elections?	claim
30	153	Genetic Programming, Validation Sets, and Parsimony Pressure	claim
31	153	A distributed approximation algorithm for the minimum degree minimum weight spanning trees	claim
32	152	On Reduced Complexity Soft-Output MIMO ML detection	claim
33	152	APHRODITE: an Anomaly-based Architecture for False Positive Reduction	claim
34	151	High SNR Analysis for MIMO Broadcast Channels: Dirty Paper Coding vs. Linear Precoding	claim
35	151	On the Secrecy Capacity of Fading Channels	claim
36	151	Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes	claim
37	151	Combining decision procedures for the reals	claim
38	151	Fast matrix multiplication is stable	claim
39	151	A general computation rule for lossy summaries/messages with examples from equalization	claim
40	151	Graph Laplacians and their convergence on random neighborhood graphs	claim
41	150	The approximability of MAX CSP with fixed-value constraints	claim
42	150	An Achievability Result for the General Relay Channel	claim
43	149	Synonym search in Wikipedia: Synarcher	claim
44	148	Budget Optimization in Search-Based Advertising Auctions	claim
45	148	Elementary Proof of a Theorem of Jean Ville	claim
46	147	ARQ Diversity in Fading Random Access Channels	claim
47	147	Models simulation and interoperability using MDA and HLA	claim
48	146	Approximation Algorithms for Multi-Criteria Traveling Salesman Problems	claim
49	146	Oblivious-Transfer Amplification	claim
50	146	The Haar Wavelet Transform of a Dendrogram	claim
51	145	Algebraic Signal Processing Theory	claim
52	145	Asymptotic SER and Outage Probability of MIMO MRC in Correlated Fading	claim
53	145	MIMO Broadcast Channels with Block Diagonalization and Finite Rate Feedback	claim
54	145	Product Multicommodity Flow in Wireless Networks	claim
55	144	On the logical definability of certain graph and poset languages	claim
56	144	Estimation of linear, non-gaussian causal models in the presence of confounding latent variables	claim
57	144	The minimum linear arrangement problem on proper interval graphs	claim
58	143	Revealing the Autonomous System Taxonomy: The Machine Learning Approach	claim
59	143	A Knowledge-Based Approach for Selecting Information Sources	claim
60	143	Efficient Route Tracing from a Single Source	claim
61	142	Social Browsing on Flickr	claim
62	142	Exploiting multilingual nomenclatures and language-independent text features as an interlingua for cross-lingual text analysis applications	claim
63	142	Order-Optimal Data Aggregation in Wireless Sensor Networks - Part I: Regular Networks	claim
64	142	Decentralized Erasure Codes for Distributed Networked Storage	claim
65	141	Spectra of large block matrices	claim
66	141	Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels	claim
67	141	Ideas by Statistical Mechanics (ISM)	claim
68	140	Nearly optimal exploration-exploitation decision thresholds
69	140	Cooperative Relay Broadcast Channels	claim
70	140	A Vortex Method for Bi-phasic Fluids Interacting with Rigid Bodies	claim
71	139	Functional Brain Imaging with Multi-Objective Multi-Modal Evolutionary Optimization	claim
72	138	Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements	claim
73	138	Applying and Combining Three Different Aspect Mining Techniques	claim
74	137	Users' participation to the design process in an Open Source Software online community	claim
75	137	Lambda Types on the Lambda Calculus with Abbreviations	claim
76	137	Achievable Rates for the Multiple Access Channel with Feedback and Correlated Sources	claim
77	137	Resettable Zero Knowledge in the Bare Public-Key Model under Standard Assumption	claim
78	136	A Case for Peering of Content Delivery Networks	claim
79	136	Bargaining over the interference channel	claim
80	136	On the Capacity of Multiple Access Channels with State Information and Feedback	claim
81	135	An equilibrium model for matching impatient demand and patient supply over time	claim
82	135	The Calculus of Algebraic Constructions	claim
83	135	Constraint Functional Logic Programming over Finite Domains	claim
84	135	On the MacWilliams Identity for Convolutional Codes	claim
85	135	Robust Distributed Source Coding	claim
86	135	Classification of Ordinal Data	claim
87	134	Max-Cut and Max-Bisection are NP-hard on unit disk graphs	claim
88	134	Analyzing language development from a network approach	claim
89	134	Topology for Distributed Inference on Graphs	claim
90	133	IP over P2P: Enabling Self-configuring Virtual IP Networks for Grid Computing	claim
91	133	A Business Goal Driven Approach for Understanding and Specifying Information Security Requirements	claim
92	132	A Decomposition Theory for Binary Linear Codes	claim
93	132	Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element	claim
94	132	Navigating multilingual news collections using automatically extracted information	claim
95	132	The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies	claim
96	132	Cross-Entropy method: convergence issues for extended implementation	claim
97	132	Perturbation Analysis of a Variable M/M/1 Queue: A Probabilistic Approach	claim
98	132	Packrat Parsing: Simple, Powerful, Lazy, Linear Time	claim
99	132	ACD Term Rewriting	claim
100	131	Dependency Treebanks: Methods, Annotation Schemes and Tools	claim
101	131	Analysis of LDGM and compound codes for lossy compression and binning	claim
102	131	A framework of reusable structures for mobile agent development	claim
103	131	Intensional Models for the Theory of Types	claim
104	131	Sequences with constant number of return words	claim
105	130	Genetic Programming for Kernel-based Learning with Co-evolving Subsets Selection	claim
106	130	Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic	claim
107	130	Cryptanalysis of a chaotic block cipher with external key and its improved version	claim
108	130	On optimal quantization rules for some sequential decision problems	claim
109	129	Topology Control and Network Lifetime in Three-Dimensional Wireless Sensor Networks	claim
110	129	Instanton analysis of Low-Density-Parity-Check codes in the error-floor regime	claim
111	129	On the Optimality of the ARQ-DDF Protocol	claim
112	129	The Diffie-Hellman Key Exchange Protocol and non-abelian nilpotent groups	claim
113	129	MIMO Broadcast Channels with Finite Rate Feedback	claim
114	129	Craig's Interpolation Theorem formalised and mechanised in Isabelle/HOL	claim
115	128	Generalizations of the Hanoi Towers Problem	claim
116	128	The Shannon capacity of a graph and the independence numbers of its powers	claim
117	128	Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs	claim
118	127	On the Peak-to-Mean Envelope Power Ratio of Phase-Shifted Binary Codes	claim
119	127	Space Division Multiple Access with a Sum Feedback Rate Constraint	claim
120	127	Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising	claim
121	127	A Semidefinite Relaxation for Air Traffic Flow Scheduling	claim
122	127	Semi-Supervised Learning -- A Statistical Physics Approach	claim
123	127	Guessing Facets: Polytope Structure and Improved LP Decoder	claim
124	127	Post-Processing Hierarchical Community Structures: Quality Improvements and Multi-scale View	claim
125	126	Power Control for User Cooperation	claim
126	126	The Gaussian Multiple Access Wire-Tap Channel	claim
127	126	Evaluating the Robustness of Learning from Implicit Feedback	claim
128	126	Belief Calculus	claim
129	126	Updating Probabilities	claim
130	126	Logic programs with monotone abstract constraint atoms	claim
131	125	Barriers and local minima in energy landscapes of stochastic local search	claim
132	125	Reversible Logic to Cryptographic Hardware: A New Paradigm	claim
133	125	10^(10^6) Worlds and Beyond: Efficient Representation and Processing of Incomplete Information	claim
134	124	Linear Encodings of Bounded LTL Model Checking	claim
135	124	Next Generation Language Resources using GRID	claim
136	124	A Feedback Reduction Technique for MIMO Broadcast Channels	claim
137	123	Directed animals in the gas	claim
138	123	The complexity of acyclic conjunctive queries revisited	claim
139	123	Continuations, proofs and tests	claim
140	123	Counting good truth assignments of random k-SAT formulae	claim
141	123	Context for models of concurrency	claim
142	122	Coupling Methodology within the Software Platform Alliances	claim
143	122	The Capacity Region of a Class of Discrete Degraded Interference Channels	claim
144	122	Open Answer Set Programming with Guarded Programs	claim
145	122	Derivatives of Entropy Rate in Special Families of Hidden Markov Chains	claim
146	122	Unification of multi-lingual scientific terminological resources using the ISO 16642 standard. The TermSciences initiative	claim
147	122	On the complexity of XPath containment in the presence of disjunction, DTDs, and variables	claim
148	121	On Using Matching Theory to Understand P2P Network Design	claim
149	121	Heterogeneous Strong Computation Migration	claim
150	121	A Scalable Protocol for Cooperative Time Synchronization Using Spatial Averaging	claim
151	121	Number sequence representation of protein structures based on the second derivative of a folded tetrahedron sequence	claim
152	121	On Performance of Event-to-Sink Transport in Transmit-Only Sensor Networks	claim
153	121	Elgot Algebras	claim
154	121	Loop series for discrete statistical models on graphs	claim
155	121	On the Foundations of Universal Sequence Prediction	claim
156	121	Use of UML and Model Transformations for Workflow Process Definitions	claim
157	120	Termination orders for 3-dimensional rewriting	claim
158	120	Watermarking Using Decimal Sequences	claim
159	120	Improved Bounds and Schemes for the Declustering Problem	claim
160	120	Reasoning About Knowledge of Unawareness	claim
161	120	On Cosets of the Generalized First-Order Reed-Muller Code with Low PMEPR	claim
162	120	Cognitive Radio: An Information-Theoretic Perspective	claim
163	120	On the Role of Shared Entanglement	claim
164	120	Logic Column 15: Coalgebras and Their Logics	claim
165	119	Clustering and Sharing Incentives in BitTorrent Systems	claim
166	119	An approach to RAID-6 based on cyclic groups of a prime order	claim
167	119	2FACE: Bi-Directional Face Traversal for Efficient Geometric Routing	claim
168	119	DepAnn - An Annotation Tool for Dependency Treebanks	claim
169	119	Enhanced Prolog Remote Predicate Call Protocol	claim
170	119	CoInduction in Coq	claim
171	119	Network Inference from Co-Occurrences	claim
172	119	Restricted Strip Covering and the Sensor Cover Problem	claim
173	119	Broadcast Cooperation Strategies for Two Colocated Users	claim
174	119	Calculating modules in contextual logic program refinement	claim
175	118	Wireless Information-Theoretic Security - Part I: Theoretical Aspects	claim
176	118	Integration and mining of malaria molecular, functional and pharmacological data: how far are we from a chemogenomic knowledge space?	claim
177	118	Minimally Invasive Randomization for Collecting Unbiased Preferences from Clickthrough Logs	claim
178	117	Explicit factors of some iterated resultants and discriminants	claim
179	117	Neural Computation with Rings of Quasiperiodic Oscillators	claim
180	117	A Computational Model of Spatial Memory Anticipation during Visual Search	claim
181	117	Intrusion detection mechanisms for VoIP applications	claim
182	117	A comparison between two logical formalisms for rewriting	claim
183	117	Distributed Transmit Beamforming using Feedback Control	claim
184	117	The Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy Constraints	claim
185	116	Quantitative Measurements of the Influence of Participant Roles during Peer Review Meetings	claim
186	116	On the Fading Paper Achievable Region of the Fading MIMO Broadcast Channel	claim
187	116	Rewriting modulo in Deduction modulo	claim
188	116	Analysis of Equality Relationships for Imperative Programs	claim
189	116	Energy Efficiency and Delay Quality-of-Service in Wireless Networks	claim
190	116	Building Scenarios for Environmental Management and Planning: An IT-Based Approach	claim
191	116	On Covering a Graph Optimally with Induced Subgraphs	claim
192	116	Memory Aware High-Level Synthesis for Embedded Systems	claim
193	115	New security and control protocol for VoIP based on steganography and digital watermarking	claim
194	115	On the Block Error Probability of LP Decoding of LDPC Codes	claim
195	115	Entropy-optimal Generalized Token Bucket Regulator	claim
196	115	minimUML: A Minimalist Approach to UML Diagraming for Early Computer Science Education	claim
197	114	A Byzantine Fault Tolerant Distributed Commit Protocol	claim
198	114	Properties of codes in rank metric	claim
199	114	Fast algorithms for computing isogenies between elliptic curves	claim
200	114	Single-Symbol Maximum Likelihood Decodable Linear STBCs	claim
201	114	Emergence Explained	claim
202	114	On Non-coherent MIMO Channels in the Wideband Regime: Capacity and Reliability	claim
203	114	Quasi-Orthogonal STBC With Minimum Decoding Complexity	claim
204	114	Polynomial-time algorithms for coding across multiple unicasts	claim
205	114	A New Cryptosystem Based On Hidden Order Groups	claim
206	114	Peer to Peer Networks for Defense Against Internet Worms	claim
207	114	Dealing with Metonymic Readings of Named Entities	claim
208	114	A Java Based Architecture of P2P-Grid Middleware	claim
209	114	Recognising the Suzuki groups in their natural representations	claim
210	113	Decentralized Maximum Likelihood Estimation for Sensor Networks Composed of Nonlinearly Coupled Dynamical Systems	claim
211	113	A Unified View of TD Algorithms; Introducing Full-Gradient TD and Equi-Gradient Descent TD	claim
212	113	Language, logic and ontology: uncovering the structure of commonsense knowledge	claim
213	113	Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems	claim
214	113	Study of Self-Organization Model of Multiple Mobile Robot	claim
215	113	Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme	claim
216	113	Event Systems and Access Control	claim
217	113	Diagonal Peg Solitaire	claim
218	113	Secure Positioning of Mobile Terminals with Simplex Radio Communication	claim
219	113	The Tree Inclusion Problem: In Linear Space and Faster	claim
220	112	Algorithms and Approaches of Proxy Signature: A Survey	claim
221	112	Complementary Sets, Generalized Reed-Muller Codes, and Power Control for OFDM	claim
222	112	Lossless coding for distributed streaming sources	claim
223	112	Joint universal lossy coding and identification of i.i.d. vector sources	claim
224	112	Outage Capacity of the Fading Relay Channel in the Low SNR Regime	claim
225	112	Perspective alignment in spatial language	claim
226	112	Curve Shortening and the Rendezvous Problem for Mobile Autonomous Robots	claim
227	112	High-level synthesis under I/O Timing and Memory constraints	claim
228	112	Performance Analysis of Iterative Channel Estimation and Multiuser Detection in Multipath DS-CDMA Channels	claim
229	112	Imagination as Holographic Processor for Text Animation	claim
230	112	The Diversity Order of the Semidefinite Relaxation Detector	claim
231	112	Entropy And Vision	claim
232	112	Pull-Based Data Broadcast with Dependencies: Be Fair to Users, not to Items	claim
233	112	Satisfying KBO Constraints	claim
234	111	The minimum size required of a solitaire army	claim
235	111	An associative memory for the on-line recognition and prediction of temporal sequences	claim
236	111	Universal decoding with an erasure option	claim
237	111	Security and Non-Repudiation for Voice-Over-IP Conversations	claim
238	111	Raisonner avec des diagrammes : perspectives cognitives et computationnelles	claim
239	111	Length-based cryptanalysis: The case of Thompson's Group	claim
240	110	Reliable Multi-Path Routing Schemes for Real-Time Streaming	claim
241	110	Definitions by Rewriting in the Calculus of Constructions	claim
242	110	The topology of covert conflict	claim
243	110	On Multistage Successive Refinement for Wyner-Ziv Source Coding with Degraded Side Informations	claim
244	110	New Millennium AI and the Convergence of History	claim
245	110	An Analysis of Arithmetic Constraints on Integer Intervals	claim
246	110	Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters	claim
247	110	Multiple Access Channels with State Information Known at Some Encoders	claim
248	109	On Conditional Branches in Optimal Decision Trees	claim
249	109	Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks	claim
250	109	Optimal Design of Multiple Description Lattice Vector Quantizers	claim
251	109	Prop-Based Haptic Interaction with Co-location and Immersion: an Automotive Application	claim
252	109	Decision Making with Side Information and Unbounded Loss Functions	claim
253	109	Singular Values and Eigenvalues of Tensors: A Variational Approach	claim
254	108	Two polygraphic presentations of Petri nets	claim
255	108	Mutual Information Games in Multi-user Channels with Correlated Jamming	claim
256	108	An asymptotically tight bound on the number of connected components of realizable sign conditions	claim
257	108	Scheduling and Codeword Length Optimization in Time Varying Wireless Networks	claim
258	108	Static Analysis using Parameterised Boolean Equation Systems	claim
259	107	Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation	claim
260	107	The Multiple Access Channel with Feedback and Correlated Sources	claim
261	107	On Sequence Prediction for Arbitrary Measures	claim
262	107	Optimal Scheduling of Peer-to-Peer File Dissemination	claim
263	106	The virtual reality framework for engineering objects	claim
264	106	Rectangular Layouts and Contact Graphs	claim
265	106	Checkbochs: Use Hardware to Check Software	claim
266	106	Parallel vs. Sequential Belief Propagation Decoding of LDPC Codes over GF(q) and Markov Sources	claim
267	106	Iso9000 Based Advanced Quality Approach for Continuous Improvement of Manufacturing Processes	claim
268	106	Adapting a general parser to a sublanguage	claim
269	106	Reasoning with Intervals on Granules	claim
270	105	Mixing and non-mixing local minima of the entropy contrast for blind source separation	claim
271	105	Construction algorithm for network error-correcting codes attaining the Singleton bound	claim
272	105	A Combinatorial Family of Near Regular LDPC Codes	claim
273	105	Reducing Tile Complexity for Self-Assembly Through Temperature Programming	claim
274	105	Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example	claim
275	105	Generalization error bounds in semi-supervised classification under the cluster assumption	claim
276	105	Knowledge Flow Analysis for Security Protocols	claim
277	105	Capacity Results for Block-Stationary Gaussian Fading Channels with a Peak Power Constraint	claim
278	105	Threshold-Controlled Global Cascading in Wireless Sensor Networks	claim
279	105	On Construction of the (24,12,8) Golay Codes	claim
280	105	Employing Trusted Computing for the forward pricing of pseudonyms in reputation systems	claim
281	105	Using Users' Expectations to Adapt Business Intelligence Systems	claim
282	104	Loop corrections for approximate inference	claim
283	104	Turning Cluster Management into Data Management: A System Overview	claim
284	104	Multigroup-Decodable STBCs from Clifford Algebras	claim
285	104	On Universally Decodable Matrices for Space-Time Coding	claim
286	104	Unmanaged Internet Protocol: Taming the Edge Network Management Crisis	claim
287	104	Asymptotically Optimal Multiple-access Communication via Distributed Rate Splitting	claim
288	104	From Proof Nets to the Free *-Autonomous Category	claim
289	104	Modeling Adversaries in a Logic for Security Protocol Analysis	claim
290	104	Conflict Free Rule for Combining Evidences	claim
291	104	New Cross-Layer Channel Switching Policy for TCP Transmission on 3G UMTS Downlink	claim
292	103	Unifying Lexicons in view of a Phonological and Morphological Lexical DB	claim
293	103	Positional Determinacy of Games with Infinitely Many Priorities	claim
294	103	ECA-RuleML: An Approach combining ECA Rules with temporal interval-based KR Event/Action Logics and Transactional Update Logics	claim
295	103	Pants Decomposition of the Punctured Plane	claim
296	103	On Separation, Randomness and Linearity for Network Codes over Finite Fields	claim
297	103	VXA: A Virtual Architecture for Durable Compressed Archives	claim
298	103	Prolog Server Pages	claim
299	103	AS Relationships: Inference and Validation	claim
300	103	Semantics and Complexity of SPARQL	claim
301	103	Laws in Darwinian Evolutionary Theory	claim
302	103	Expressing Security Properties Using Selective Interleaving Functions	claim
303	103	Finite State Channels with Time-Invariant Deterministic Feedback	claim
304	102	Architecture for Modular Data Centers	claim
305	102	On the User Selection for MIMO Broadcast Channels	claim
306	102	Structural Inference of Hierarchies in Networks	claim
307	102	A Formal Foundation for ODRL	claim
308	102	Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds	claim
309	102	A library of Taylor models for PVS automatic proof checker	claim
310	102	Similarity of Objects and the Meaning of Words	claim
311	102	Theoretical Properties of Projection Based Multilayer Perceptrons with Functional Inputs	claim
312	102	On the reduction of a random basis	claim
313	102	Dimension Extractors and Optimal Decompression	claim
314	101	Church's thesis is questioned by new calculation paradigm	claim
315	101	Geographic Gossip: Efficient Aggregation for Sensor Networks	claim
316	101	MDL Convergence Speed for Bernoulli Sequences	claim
317	101	Metric State Space Reinforcement Learning for a Vision-Capable Mobile Robot	claim
318	101	Fast computation of power series solutions of systems of differential equations	claim
319	101	Foundations of Modern Language Resource Archives	claim
320	101	Context-Sensitive Languages, Rational Graphs and Determinism	claim
321	101	Fault-Tolerant Real-Time Streaming with FEC thanks to Capillary Multi-Path Routing	claim
322	101	List decoding of noisy Reed-Muller-like codes	claim
323	100	Confrontation of viewpoints in a concurrent engineering process	claim
324	100	A Combined LIFO-Priority Scheme for Overload Control of E-commerce Web Servers	claim
325	100	Restricted Complexity, General Complexity	claim
326	100	How to beat the sphere-packing bound with feedback	claim
327	100	Automatic Identification of Document Translations in Large Multilingual Document Collections	claim
328	100	Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels	claim
329	100	Automatic annotation of multilingual text collections with a conceptual thesaurus	claim
330	100	Using groups for investigating rewrite systems	claim
331	100	A Formal Treatment of Generalized Preferential Attachment and its Empirical Validation	claim
332	100	Community Structure in the United States House of Representatives	claim
333	100	If a tree casts a shadow is it telling the time?	claim
334	100	Pivotal and Pivotal-discriminative Consequence Relations	claim
335	100	Minimizing Symmetric Set Functions Faster	claim
336	100	Error Exponents of Low-Density Parity-Check Codes on the Binary Erasure Channel	claim
337	100	Authorised Translations of Electronic Documents	claim
338	100	Capacity of Cooperative Fusion in the Presence of Byzantine Sensors	claim
339	100	Wiretap Channel With Side Information	claim
340	99	Intermediate Performance of Rateless Codes	claim
341	99	A New Approach for Capacity Analysis of Large Dimensional Multi-Antenna Channels	claim
342	99	Statistical mechanics of neocortical interactions: Portfolio of Physiological Indicators	claim
343	99	Pathways: Augmenting interoperability across scholarly repositories	claim
344	99	Inductive types in the Calculus of Algebraic Constructions	claim
345	99	Cross-lingual keyword assignment	claim
346	99	PAC Learning Mixtures of Axis-Aligned Gaussians with No Separation Assumption	claim
347	99	Rational stochastic languages	claim
348	99	Logical settings for concept learning from incomplete examples in First Order Logic	claim
349	99	The single-serving channel capacity	claim
350	99	An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus	claim
351	98	Recurrence relations and fast algorithms	claim
352	98	Dense Linear Algebra over Finite Fields: the FFLAS and FFPACK packages	claim
353	98	Faster Algorithms for Constructing a Concept (Galois) Lattice	claim
354	98	A Formal Measure of Machine Intelligence	claim
355	98	Enabling user-driven Checkpointing strategies in Reverse-mode Automatic Differentiation	claim
356	98	Asynchronous iterative computations with Web information retrieval structures: The PageRank case	claim
357	98	Bayesian Regression of Piecewise Constant Functions	claim
358	98	Fusion of qualitative beliefs using DSmT	claim
359	98	A field-theory motivated approach to symbolic computer algebra	claim
360	98	On Quasi-Interpretations, Blind Abstractions and Implicit Complexity	claim
361	98	Reversal Complexity Revisited	claim
362	97	Towards a Bayesian framework for option pricing	claim
363	97	Stabilization using both noisy and noiseless feedback	claim
364	97	Ontologies and Information Extraction	claim
365	97	Improved Nearly-MDS Expander Codes	claim
366	97	Explicit Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeoff	claim
367	97	Trusted Computing in Mobile Action	claim
368	97	The one-way communication complexity of the Boolean Hidden Matching Problem	claim
369	97	Heap Reference Analysis Using Access Graphs	claim
370	96	Evocation and elaboration of solutions: Different types of problem-solving actions. An empirical study on the design of an aerospace artifact	claim
371	96	Distributed Link Scheduling with Constant Overhead	claim
372	96	The intersection and the union of the asynchronous systems	claim
373	96	Metric entropy in competitive on-line prediction	claim
374	96	The Evolution of Cyberinsurance	claim
375	96	Intrinsically Legal-For-Trade Objects by Digital Signatures	claim
376	96	Communication Bottlenecks in Scale-Free Networks	claim
377	96	On the Capacity of Fading MIMO Broadcast Channels with Imperfect Transmitter Side-Information	claim
378	96	Upper Bounding the Performance of Arbitrary Finite LDPC Codes on Binary Erasure Channels	claim
379	96	Proof Search in Hajek's Basic Logic	claim
380	96	How accurate are the time delay estimates in gravitational lensing?	claim
381	96	Circle Formation of Weak Mobile Robots	claim
382	95	Large Scale In Silico Screening on Grid Infrastructures	claim
383	95	Capacity of the Trapdoor Channel with Feedback	claim
384	95	A Markov Chain based method for generating long-range dependence	claim
385	95	Coding for Additive White Noise Channels with Feedback Corrupted by Uniform Quantization or Bounded Noise	claim
386	95	Peer-to-Peer Communication Across Network Address Translators	claim
387	95	Solving Sparse Integer Linear Systems	claim
388	95	Naming Games in Spatially-Embedded Random Networks	claim
389	95	SAT Solving for Argument Filterings	claim
390	95	Prefix Coding under Siege	claim
391	95	Optimal Distortion-Power Tradeoffs in Gaussian Sensor Networks	claim
392	95	A Product Oriented Modelling Concept: Holons for systems synchronisation and interoperability	claim
393	95	The computational power of population protocols	claim
394	94	Zig-zag and Replacement Product Graphs and LDPC Codes	claim
395	94	Fitness Uniform Optimization	claim
396	94	Cooperative Lattice Coding and Decoding	claim
397	94	Computing spectral sequences	claim
398	94	Epsilon-Unfolding Orthogonal Polyhedra	claim
399	94	The Discrete Memoryless Multiple Access Channel with Confidential Messages	claim
400	94	A General Method for Finding Low Error Rates of LDPC Codes	claim
401	94	Single-Symbol-Decodable Differential Space-Time Modulation Based on QO-STBC	claim
402	94	The evolution of navigable small-world networks	claim
403	94	Representing graphs as the intersection of axis-parallel cubes	claim
404	94	Enterprise Portal: from Model to Implementation	claim
405	94	A Generic Lazy Evaluation Scheme for Exact Geometric Computations	claim
406	93	Multirobot rendezvous with visibility sensors in nonconvex environments	claim
407	93	Design approaches in technology enhanced learning	claim
408	93	LTL with the Freeze Quantifier and Register Automata	claim
409	93	Crosstalk-free Conjugate Networks for Optical Multicast Switching	claim
410	93	Constructing experimental indicators for Open Access documents	claim
411	93	Geocoding multilingual texts: Recognition, disambiguation and visualisation	claim
412	93	Free Choice Petri Nets without frozen tokens and Bipolar Synchronization Systems	claim
413	93	The ALVIS Format for Linguistically Annotated Documents	claim
414	93	Functional dissipation microarrays for classification	claim
415	93	Sparse Matrix Implementation in Octave	claim
416	93	Unbiased Matrix Rounding	claim
417	93	Fast and Simple Methods For Computing Control Points	claim
418	93	Stability in multidimensional Size Theory	claim
419	92	Personal Information Ecosystems and Implications for Design	claim
420	92	Highly robust error correction by convex programming	claim
421	92	Event-based Information Extraction for the biomedical domain: the Caderige project	claim
422	92	Myopic Coding in Wireless Networks	claim
423	92	Performance of STBC MC-CDMA systems over outdoor realistic MIMO channels	claim
424	92	Combinatorial laplacians and positivity under partial transpose	claim
425	91	Improved results for a memory allocation problem	claim
426	91	Experiments on predictability of word in context and information rate in natural language	claim
427	91	Complexity of Data Flow Analysis for Non-Separable Frameworks	claim
428	91	Adaptive Poisson disorder problem	claim
429	91	SCRUB-PA: A Multi-Level Multi-Dimensional Anonymization Tool for Process Accounting	claim
430	91	Why neighbor-joining works	claim
431	91	Universal Codes as a Basis for Time Series Testing	claim
432	91	Analyse non standard du bruit	claim
433	91	Variational optimization of probability measure spaces resolves the chain store paradox	claim
434	91	Numeration-automatic sequences	claim
435	91	The Complexity of Mean Flow Time Scheduling Problems with Release Times	claim
436	91	Aligned Virtual Coordinates for Greedy Routing in WSNs	claim
437	91	3-facial colouring of plane graphs	claim
438	91	Quasi-friendly sup-interpretations	claim
439	90	About the Lifespan of Peer to Peer Networks	claim
440	90	Symmetric Subresultants and Applications	claim
441	90	Relatively inertial delays	claim
442	90	Quaternary Constant-Amplitude Codes for Multicode CDMA	claim
443	90	Norm Based Causal Reasoning in Textual Corpus	claim
444	90	Decoder Error Probability of MRD Codes	claim
445	90	The recognizability of sets of graphs is a robust property	claim
446	90	Google Web APIs - an Instrument for Webometric Analyses?	claim
447	90	On comparing sums of square roots of small integers	claim
448	90	The Snowblower Problem	claim
449	90	Key Distillation and the Secret-Bit Fraction	claim
450	90	A constructive and unifying framework for zero-bit watermarking	claim
451	90	Path-independent load balancing with unreliable machines	claim
452	90	On entropy for mixtures of discrete and continuous variables	claim
453	89	Anomalous heat-kernel decay for random walk among bounded random conductances	claim
454	89	Reuse of Specification Patterns with the B Method	claim
455	89	Design of Rate-Compatible Serially Concatenated Convolutional Codes	claim
456	89	Finite-State Dimension and Real Arithmetic	claim
457	89	eJournal interface can influence usage statistics: implications for libraries, publishers, and Project COUNTER	claim
458	89	User-Relative Names for Globally Connected Personal Devices	claim
459	89	Computing the First Few Betti Numbers of Semi-algebraic Sets in Single Exponential Time	claim
460	89	Caractéristiques arithmétiques des processeurs graphiques	claim
461	89	On the Efficiency of Strategies for Subdividing Polynomial Triangular Surface Patches	claim
462	89	Upright-Quad Drawing of st-Planar Learning Spaces	claim
463	88	Both Generic Design and Different Forms of Designing	claim
464	88	The Power and Perils of MDL	claim
465	88	Inductive-data-type Systems	claim
466	88	A Constructive Semantic Characterization of Aggregates in ASP	claim
467	88	Polynomial Time Nondimensionalisation of Ordinary Differential Equations via their Lie Point Symmetries	claim
468	88	A Chaotic Cipher Mmohocc and Its Randomness Evaluation	claim
469	88	Provably Secure Universal Steganographic Systems	claim
470	88	On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas	claim
471	88	Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes	claim
472	88	A Graph-based Framework for Transmission of Correlated Sources over Broadcast Channels	claim
473	87	Synchronization recovery and state model reduction for soft decoding of variable length codes	claim
474	87	Hedging predictions in machine learning	claim
475	87	Capacity of a Class of Deterministic Relay Channels	claim
476	87	Longest Common Pattern between two Permutations	claim
477	87	Pseudorandomness and Combinatorial Constructions	claim
478	87	An Optimal Distributed Edge-Biconnectivity Algorithm	claim
479	87	An Extremal Inequality Motivated by Multiterminal Information Theoretic Problems	claim
480	87	Low Complexity Algorithms for Linear Recurrences	claim
481	86	Improving Precision of Type Analysis Using Non-Discriminative Union	claim
482	86	Maximum Entropy MIMO Wireless Channel Models	claim
483	86	Semantic results for ontic and epistemic change	claim
484	86	Loop Calculus in Statistical Physics and Information Science	claim
485	86	Optimal Distortion-Power Tradeoffs in Sensor Networks: Gauss-Markov Random Processes	claim
486	86	Evolutionary Socioeconomics: a Schumpeterian Computer Simulation	claim
487	86	Modeling and Mathematical Analysis of Swarms of Microscopic Robots	claim
488	86	Mining Behavioral Groups in Large Wireless LANs	claim
489	86	Integrating Enterprise Software Applications with Web Portal Technology	claim
490	85	Discovering Network Topology in the Presence of Byzantine Faults	claim
491	85	Interference Channels with Common Information	claim
492	85	A Characterization of the Degree Sequences of 2-Trees	claim
493	85	Fairness in Multiuser Systems with Polymatroid Capacity Region	claim
494	84	Truncating the loop series expansion for Belief Propagation	claim
495	84	Rhythms of social interaction: messaging within a massive online network	claim
496	84	On the freeze quantifier in Constraint LTL: decidability and complexity	claim
497	84	The JRC-Acquis: A multilingual aligned parallel corpus with 20+ languages	claim
498	84	PLTL Partitioned Model Checking for Reactive Systems under Fairness Assumptions	claim
499	84	A Recursive Method for Determining the One-Dimensional Submodules of Laurent-Ore Modules	claim
500	84	A simple generalization of El-Gamal cryptosystem to non-abelian groups	claim
501	84	A new function algebra of EXPTIME functions by safe nested recursion	claim
502	83	Fast linear algebra is stable	claim
503	83	Challenging the principle of compositionality in interpreting natural language texts	claim
504	83	Measuring Fundamental Properties of Real-World Complex Networks	claim
505	83	From Neuron to Neural Networks dynamics	claim
506	83	A Multi-Relational Network to Support the Scholarly Communication Process	claim
507	83	How to Beat the Adaptive Multi-Armed Bandit	claim
508	83	Near orders and codes	claim
509	83	Performance Analysis of CDMA Signature Optimization with Finite Rate Feedback	claim
510	83	Implementation and Deployment of a Distributed Network Topology Discovery Algorithm	claim
511	83	Guessing under source uncertainty	claim
512	83	Perfect Space Time Block Codes	claim
513	83	An unlikely result	claim
514	83	Performance comparison of multi-user detectors for the downlink of a broadband MC-CDMA system	claim
515	83	Bidding to the Top: VCG and Equilibria of Position-Based Auctions	claim
516	82	The Parma Polyhedra Library: Toward a Complete Set of Numerical Abstractions for the Analysis and Verification of Hardware and Software Systems	claim
517	82	Higher-Order Termination: from Kruskal to Computability	claim
518	82	Random numbers for large scale distributed Monte Carlo simulations	claim
519	82	Coq in a Hurry	claim
520	82	Mapping the Bid Behavior of Conference Referees	claim
521	82	Explicit Randomness is not Necessary when Modeling Probabilistic Encryption	claim
522	82	Rate Regions for Relay Broadcast Channels	claim
523	81	The Workshop on Internet Topology (WIT) Report	claim
524	81	Multivariate Integral Perturbation Techniques - I (Theory)	claim
525	81	Subsystem Codes	claim
526	81	Better than the real thing? Iterative pseudo-query processing using cluster-based language models	claim
527	81	Low density codes achieve the rate-distortion bound	claim
528	81	The emergence of knowledge exchange: an agent-based model of a software market	claim
529	81	Universal Filtering via Hidden Markov Modeling	claim
530	81	Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker bounds	claim
531	81	Modeling Aspect Mechanisms: A Top-Down Approach	claim
532	81	A Finite Equational Base for CCS with Left Merge and Communication Merge	claim
533	81	Radial Structure of the Internet	claim
534	80	Mental Representations Constructed by Experts and Novices in Object-Oriented Program Comprehension	claim
535	80	Exact Failure Frequency Calculations for Extended Systems	claim
536	80	Algebraic Soft-Decision Decoding of Reed-Solomon Codes Using Bit-level Soft Information	claim
537	80	Dichotomies and Duality in First-order Model Checking Problems	claim
538	80	From Dumb Wireless Sensors to Smart Networks using Network Coding	claim
539	80	Analysis of Dynamic Task Allocation in Multi-Robot Systems	claim
540	80	A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs	claim
541	79	On the structure of generalized toric codes	claim
542	79	Source coding and channel requirements for unstable processes	claim
543	79	New Technologies for Sustainable Urban Transport in Europe	claim
544	79	LLL Reduction Achieves the Receive Diversity in MIMO Decoding	claim
545	79	Certainty Closure: Reliable Constraint Reasoning with Incomplete or Erroneous Data	claim
546	79	Feedback Capacity of Stationary Gaussian Channels	claim
547	79	May We Have Your Attention: Analysis of a Selective Attention Task	claim
548	79	Geometric definition of a new skeletonization concept	claim
549	78	What is the probability of connecting two points ?	claim
550	78	Gaussian Fading is the Worst Fading	claim
551	78	On the Fading Number of Multiple-Input Single-Output Fading Channels with Memory	claim
552	78	A Formal Architecture-Centric Model-Driven Approach for the Automatic Generation of Grid Applications	claim
553	78	Information theory and Thermodynamics	claim
554	78	Preferential attachment in the growth of social networks: the case of Wikipedia	claim
555	78	Efficient algorithms for deciding the type of growth of products of integer matrices	claim
556	78	FLAIM: A Multi-level Anonymization Framework for Computer and Network Logs	claim
557	78	Opti{c,m}al: Optical/Optimal Routing in Massively Dense Wireless Networks	claim
558	77	Working times in atypical forms of employment: the special case of part-time work	claim
559	77	Deductive Object Programming	claim
560	77	Quantization Bounds on Grassmann Manifolds and Applications to MIMO Communications	claim
561	77	Generalized Entropy Power Inequalities and Monotonicity Properties of Information	claim
562	77	Lack of Finite Characterizations for the Distance-based Revision	claim
563	77	Prioritizing Software Inspection Results using Static Profiling	claim
564	76	Inconsistent parameter estimation in Markov random fields: Benefits in the computation-limited setting	claim
565	76	The Quantum Separability Problem for Gaussian States	claim
566	76	Unary Primitive Recursive Functions	claim
567	76	Complexity Constrained Noise-Free CDMA: Optimal Power Distribution and Spectral Efficiency	claim
568	75	Implementation of float-float operators on graphics hardware	claim
569	74	Guard Placement For Wireless Localization	claim
570	74	Approximation algorithms for wavelet transform coding of data streams	claim
571	74	Scheduling Algorithms for Procrastinators	claim
572	74	PAC Classification based on PAC Estimates of Label Class Distributions	claim
573	73	Proof Nets and the Identity of Proofs	claim
574	73	A Fast and Accurate Nonlinear Spectral Method for Image Recognition and Registration	claim
575	73	Stable partitions in coalitional games	claim
576	72	Extending an Information Extraction tool set to Central and Eastern European languages	claim
577	72	A secure archive for Voice-over-IP conversations	claim
578	71	Using NLP to build the hypertextuel network of a back-of-the-book index	claim
579	71	Wreath Products in Stream Cipher Design	claim
580	71	On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures	claim
581	70	Channel Coding: The Road to Channel Capacity	claim
582	70	The complexity of class polynomial computation via floating point approximations	claim
583	70	Scalable Algorithms for Aggregating Disparate Forecasts of Probability	claim
584	69	Memory and compiler optimizations for low-power and -energy	claim
585	69	Bounds on the coefficients of the characteristic and minimal polynomials	claim
586	68	Using shifted conjugacy in braid-based cryptography	claim
587	68	Journal Status	claim
588	68	State Space Realizations and Monomial Equivalence for Convolutional Codes	claim
589	68	A rigorous proof of the cavity method for counting matchings	claim
590	67	Reuse of designs: Desperately seeking an interdisciplinary cognitive approach	claim
591	67	Considering users' behaviours in improving the responses of an information base	claim
592	67	Error Exponents and Cutoff Rate for Noncoherent Rician Fading Channels	claim
593	66	Coding into a source: a direct inverse Rate-Distortion theorem	claim
594	66	MDL Denoising Revisited	claim
595	64	Pseudocodeword weights for non-binary LDPC codes	claim
596	63	Nominal Logic Programming	claim
597	63	A Polynomial Time Nilpotence Test for Galois Groups and Related Results	claim
598	61	Canonical Abstract Syntax Trees	claim
599	61	An outer bound to the capacity region of the broadcast channel	claim
600	60	Reusing processes and documenting processes: toward an integrated framework	claim
601	60	Identifying Crosscutting Concerns Using Fan-in Analysis	claim
602	58	Communication Over MIMO Broadcast Channels Using Lattice-Basis Reduction	claim
603	57	On Verifying Complex Properties using Symbolic Shape Analysis	claim
604	57	Monte Carlo Algorithm for Least Dependent Non-Negative Mixture Decomposition	claim
605	57	Simulating Network Influence Algorithms Using Particle-Swarms: PageRank and PageRank-Priors	claim
606	57	Program Spectra Analysis in Embedded Software: A Case Study	claim
607	55	A Flexible Bandwidth Reservation Framework for Bulk Data Transfers in Grid Networks	claim
608	53	Usage Impact Factor: the effects of sample characteristics on usage-based impact metrics	claim
609	52	A SIMO Fiber Aided Wireless Network Architecture	claim
610	39	Squarepants in a Tree: Sum of Subtree Clustering and Hyperbolic Pants Decomposition	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers