CORR 2007 - PDF Preprint Papers

CORR 2007 Workshop on Service Oriented Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CORR-2007 Paper

click to vote

CORR
2007
Springer

217views Education» more CORR 2007»

Hard constraint satisfaction problems have hard gaps at location 1

14 years 7 days ago

Download www.dur.ac.uk

An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...

Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen

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	217	Hard constraint satisfaction problems have hard gaps at location 1	claim
2	202	Designing a Virtual Manikin Animation Framework Aimed at Virtual Prototyping	claim
3	198	Clustering and Feature Selection using Sparse Principal Component Analysis	claim
4	194	Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs	claim
5	193	Multi-Sensor Fusion Method using Dynamic Bayesian Network for Precise Vehicle Localization and Road Matching	claim
6	189	Diversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks	claim
7	187	Transaction-Oriented Simulation In Ad Hoc Grids	claim
8	186	Multiuser MIMO Downlink Made Practical: Achievable Rates with Simple Channel State Estimation and Feedback Schemes	claim
9	183	A complete set of rotationally and translationally invariant features for images	claim
10	183	Compressed Sensing and Redundant Dictionaries	claim
11	182	Triangulating the Real Projective Plane	claim
12	181	A new lower bound on the independence number of a graph	claim
13	179	On the Information Rate of MIMO Systems with Finite Rate Channel State Feedback and Power On/Off Strategy	claim
14	177	Another Proof of Wright's Inequalities	claim
15	177	N3Logic: A Logical Framework For the World Wide Web	claim
16	176	Crystallization in large wireless networks	claim
17	173	Computing modular polynomials in quasi-linear time	claim
18	172	A Data-Parallel Version of Aleph	claim
19	172	Analysis of the 802.11e Enhanced Distributed Channel Access Function	claim
20	170	Animation of virtual mannequins, robot-like simulation or motion captures	claim
21	170	The structure of verbal sequences analyzed with unsupervised learning techniques	claim
22	169	Algorithmic Complexity Bounds on Future Prediction Errors	claim
23	167	Optimal Solutions for Sparse Principal Component Analysis	claim
24	167	Approximation Algorithms for Orienteering with Time Windows	claim
25	165	Comparison of Tree-Child Phylogenetic Networks	claim
26	164	Consistency of the group Lasso and multiple kernel learning	claim
27	164	Capacity Region of the Finite-State Multiple Access Channel with and without Feedback	claim
28	164	Dynamic aspects of individual design activities. A cognitive ergonomics viewpoint	claim
29	163	Personalizing Image Search Results on Flickr	claim
30	162	Exploiting Social Annotation for Automatic Resource Discovery	claim
31	162	Order-Invariant MSO is Stronger than Counting MSO in the Finite	claim
32	160	On the Correlation of Geographic and Network Proximity at Internet Edges and its Implications for Mobile Unicast and Multicast Routing	claim
33	160	Data Management: Past, Present, and Future	claim
34	160	How really effective are Multimodal Hints in enhancing Visual Target Spotting? Some evidence from a usability study	claim
35	159	Designing a Resource Broker for Heterogeneous Grids	claim
36	159	Lifetime Improvement in Wireless Sensor Networks via Collaborative Beamforming and Cooperative Transmission	claim
37	158	Model of Electrostatic Actuated Deformable Mirror Using Strongly Coupled Electro-Mechanical Finite Element	claim
38	158	Multi-group ML Decodable Collocated and Distributed Space Time Block Codes	claim
39	157	Actin - Technical Report	claim
40	156	Capacity Gain from Two-Transmitter and Two-Receiver Cooperation	claim
41	156	Analysis of a Mixed Strategy for Multiple Relay Networks	claim
42	155	Low-density graph codes that are optimal for source/channel coding and binning	claim
43	155	Algebraic Distributed Differential Space-Time Codes with Low Decoding Complexity	claim
44	154	Distributed Space-Time Codes for Cooperative Networks with Partial CSI	claim
45	154	Application of a design space exploration tool to enhance interleaver generation	claim
46	154	To Code or Not to Code Across Time: Space-Time Coding with Feedback	claim
47	154	Distributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem	claim
48	153	Power-Bandwidth Tradeoff in Dense Multi-Antenna Relay Networks	claim
49	151	The Complexity of Games on Higher Order Pushdown Automata	claim
50	151	Decision tree modeling with relational views	claim
51	151	Distributed spatial multiplexing with 1-bit feedback	claim
52	151	Exploiting Multi-Antennas for Opportunistic Spectrum Sharing in Cognitive Radio Networks	claim
53	151	The algebraicity of the lambda-calculus	claim
54	150	Social Information Processing in Social News Aggregation	claim
55	150	Composable Security in the Bounded-Quantum-Storage Model	claim
56	150	A Unified Framework for Pricing Credit and Equity Derivatives	claim
57	149	About the domino problem in the hyperbolic plane, a new solution	claim
58	149	Very fast watermarking by reversible contrast mapping	claim
59	149	Competitive minimax universal decoding for several ensembles of random codes	claim
60	149	Graph Entropy, Network Coding and Guessing games	claim
61	148	Optimal Power Allocation for Distributed Detection over MIMO Channels in Wireless Sensor Networks	claim
62	148	Linear time algorithms for Clobber	claim
63	148	Blind Estimation of Multiple Carrier Frequency Offsets	claim
64	147	Coding Solutions for the Secure Biometric Storage Problem	claim
65	147	Identifying Small Mean Reverting Portfolios	claim
66	147	Model Checking Synchronized Products of Infinite Transition Systems	claim
67	147	Influence of Micro-Cantilever Geometry and Gap on Pull-in Voltage	claim
68	147	Characterization of Flexible RF Microcoil Dedicated to Surface Mri	claim
69	147	Decomposition During Search for Propagation-Based Constraint Solvers	claim
70	146	Coding for Errors and Erasures in Random Network Coding	claim
71	146	The Long Term Fate of Our Digital Belongings: Toward a Service Model for Personal Archives	claim
72	144	Distributing the Kalman Filter for Large-Scale Systems	claim
73	144	Optimization of Information Rate Upper and Lower Bounds for Channels with Memory	claim
74	144	Heuristics for Network Coding in Wireless Networks	claim
75	143	An Approximation Algorithm for Shortest Descending Paths	claim
76	143	Capacity Scaling for MIMO Two-Way Relaying	claim
77	143	Cooperative Multi-Cell Networks: Impact of Limited-Capacity Backhaul and Inter-Users Links	claim
78	143	On Myopic Sensing for Multi-Channel Opportunistic Access	claim
79	142	Resource and Application Models for Advanced Grid Schedulers	claim
80	141	Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence	claim
81	141	A Class of Parallel Tiled Linear Algebra Algorithms for Multicore Architectures	claim
82	141	Bootstrapping Deep Lexical Resources: Resources for Courses	claim
83	141	Joint Source-Channel Codes for MIMO Block Fading Channels	claim
84	141	Managing Uncertainty: A Case for Probabilistic Grid Scheduling	claim
85	140	Virtual reality: A human centered tool for improving Manufacturing	claim
86	140	An Integrated Simulation System for Human Factors Study	claim
87	140	From the entropy to the statistical structure of spike trains	claim
88	139	SkyServer Traffic Report - The First Five Years	claim
89	139	Algorithmic Semi-algebraic Geometry and Topology -- Recent Progress and Open Problems	claim
90	139	Content Reuse and Interest Sharing in Tagging Communities	claim
91	138	Low Density Lattice Codes	claim
92	138	Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity	claim
93	138	Can the Internet cope with stress?	claim
94	138	On the Performance Evaluation of Encounter-based Worm Interactions Based on Node Characteristics	claim
95	138	Capacity of Linear Two-hop Mesh Networks with Rate Splitting, Decode-and-forward Relaying and Cooperation	claim
96	138	A CMOS-Based Tactile Sensor for Continuous Blood Pressure Monitoring	claim
97	137	Cross-Matching Multiple Spatial Observations and Dealing with Missing Data	claim
98	137	Subjective Evaluation of Forms in an Immersive Environment	claim
99	137	Bounds on the Network Coding Capacity for Wireless Random Networks	claim
100	136	On Cognitive Interference Networks	claim
101	136	The analytic computability of the Shannon transform for a large class of random matrix channels	claim
102	136	Sparsity in time-frequency representations	claim
103	136	Influence of the Feedback Filter on the Response of the Pulsed Digital Oscillator	claim
104	135	The Unix KISS: A Case Study	claim
105	135	AMIEDoT: An annotation model for document tracking and recommendation service	claim
106	135	On the decidability and complexity of Metric Temporal Logic over finite words	claim
107	135	Multiple resolution of the modular structure of complex networks	claim
108	135	Settling the Complexity of Computing Two-Player Nash Equilibria	claim
109	135	Automatically Restructuring Practice Guidelines using the GEM DTD	claim
110	135	Association Rules in the Relational Calculus	claim
111	135	Detailed Network Measurements Using Sparse Graph Counters: The Theory	claim
112	134	On Four-group ML Decodable Distributed Space Time Codes for Cooperative Communication	claim
113	134	Web data modeling for integration in data warehouses	claim
114	134	An Analytical Study of a Structured Overlay in the presence of Dynamic Membership	claim
115	134	Rate-Constrained Wireless Networks with Fading Channels: Interference-Limited and Noise-Limited Regimes	claim
116	134	A Partition-Based Relaxation For Steiner Trees	claim
117	133	Blind Identification of Distributed Antenna Systems with Multiple Carrier Frequency Offsets	claim
118	133	Virtual Manufacturing : Tools for improving Design and Production	claim
119	133	Space and camera path reconstruction for omni-directional vision	claim
120	133	On Decidability Properties of Local Sentences	claim
121	133	The price of ignorance: The impact of side-information on delay for lossless source-coding	claim
122	132	Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals	claim
123	132	Probabilistic Analysis of Linear Programming Decoding	claim
124	132	Automatic Structures: Richness and Limitations	claim
125	132	Matroid Pathwidth and Code Trellis Complexity	claim
126	132	A Generic Deployment Framework for Grid Computing and Distributed Applications	claim
127	132	Understanding the Characteristics of Internet Short Video Sharing: YouTube as a Case Study	claim
128	132	Nodally 3-connected planar graphs and convex combination mappings	claim
129	132	On Compact Routing for the Internet	claim
130	132	Fast Algorithm and Implementation of Dissimilarity Self-Organizing Maps	claim
131	132	Spreadsheet Engineering: A Research Framework	claim
132	131	Approximation Algorithms for Multiprocessor Scheduling under Uncertainty	claim
133	131	Multi-Access MIMO Systems with Finite Rate Channel State Feedback	claim
134	131	How to use the Scuba Diving metaphor to solve problem with neutrality ?	claim
135	131	Cognitive Medium Access: Exploration, Exploitation and Competition	claim
136	131	Bayesian sequential change diagnosis	claim
137	130	Characterization of Search Engine Caches	claim
138	130	On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach	claim
139	130	Achievable Rates for Two-Way Wire-Tap Channels	claim
140	130	An Autonomous Distributed Admission Control Scheme for IEEE 802.11 DCF	claim
141	130	Mobile Computing in Physics Analysis - An Indicator for eScience	claim
142	130	Lagrangian Relaxation for MAP Estimation in Graphical Models	claim
143	129	A Tutorial on Spectral Clustering	claim
144	129	A Rank-Metric Approach to Error Control in Random Network Coding	claim
145	128	Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs	claim
146	128	Model Selection Through Sparse Maximum Likelihood Estimation	claim
147	128	On the Complexity of the Interlace Polynomial	claim
148	128	Ambient Multimodality: an Asset for Developing Universal Access to the Information Society	claim
149	128	Verified Real Number Calculations: A Library for Interval Arithmetic	claim
150	128	A Mobile Computing Architecture for Numerical Simulation	claim
151	127	Attribute Exploration of Discrete Temporal Transitions	claim
152	127	Using decision problems in public key cryptography	claim
153	127	Learning Phonotactics Using ILP	claim
154	127	Common Reusable Verification Environment for BCA and RTL Models	claim
155	127	Symmetry Partition Sort	claim
156	126	Optimal Throughput-Diversity-Delay Tradeoff in MIMO ARQ Block-Fading Channels	claim
157	126	Diversity-Multiplexing Tradeoff in Selective-Fading MIMO Channels	claim
158	126	Linear Tabling Strategies and Optimizations	claim
159	126	Information Criteria and Arithmetic Codings : An Illustration on Raw Images	claim
160	126	Interference and Outage in Clustered Wireless Ad Hoc Networks	claim
161	126	Dial a Ride from k-forest	claim
162	126	Decentralized sequential change detection using physical layer fusion	claim
163	126	Rethinking Information Theory for Mobile Ad Hoc Networks	claim
164	126	The effect of fading, channel inversion, and threshold scheduling on ad hoc networks	claim
165	126	Network synchronizability analysis: the theory of subgraphs and complementary graphs	claim
166	125	Gaussian Interference Channel Capacity to Within One Bit	claim
167	125	A Disciplined Approach to Adopting Agile Practices: The Agile Adoption Framework	claim
168	125	A Study of Grid Applications: Scheduling Perspective	claim
169	125	Above Ic Micro-Power Generators for RF-Mems	claim
170	125	Common knowledge logic in a higher order proof assistant?	claim
171	124	Accelerating Socio-Technological Evolution: from ephemeralization and stigmergy to the global brain	claim
172	124	Computer Science and Game Theory: A Brief Survey	claim
173	124	A Channel that Heats Up	claim
174	124	Cellular Systems with Full-Duplex Amplify-and-Forward Relaying and Cooperative Base-Stations	claim
175	124	Diversity-Multiplexing Tradeoff via Asymptotic Analysis of Large MIMO Systems	claim
176	124	Opportunistic Network Coding for Video Streaming over Wireless	claim
177	124	Graph-Based Decoding in the Presence of ISI	claim
178	124	An exploratory study of Google Scholar	claim
179	124	Interpolation in Valiant's theory	claim
180	124	Anonymous Networking amidst Eavesdroppers	claim
181	124	Neutrosophic Relational Data Model	claim
182	124	Computer Supported Collaborative Research	claim
183	123	A Generic Analysis Environment for Curry Programs	claim
184	123	Channel Capacity Estimation using Free Probability Theory	claim
185	123	Achieving the Gaussian Rate-Distortion Function by Prediction	claim
186	123	Degrees of Freedom of Wireless X Networks	claim
187	123	On Distributed Computation in Noisy Random Planar Networks	claim
188	123	Security in Wireless Sensor Networks: Issues and Challenges	claim
189	122	Practical Identity-Based Encryption (IBE) in Multiple PKG Environments and Its Applications	claim
190	122	Modeling Epidemic Spread in Synthetic Populations - Virtual Plagues in Massively Multiplayer Online Games	claim
191	122	Social Media as Windows on the Social Life of the Mind	claim
192	122	How to Complete a Doubling Metric	claim
193	122	Impact of Thermal Behavior on Offset in a High-Q Gyroscope	claim
194	121	Analysis and design of raptor codes for joint decoding using Information Content evolution	claim
195	121	Lower Bounds on Implementing Robust and Resilient Mediators	claim
196	121	Power-Efficient Direct-Voting Assurance for Data Fusion in Wireless Sensor Networks	claim
197	121	On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks	claim
198	121	Diagrammatic Inference	claim
199	121	Use of Wikipedia Categories in Entity Ranking	claim
200	121	Iterative Filtering for a Dynamical Reputation System	claim
201	120	Performance Analysis of Algebraic Soft-Decision Decoding of Reed-Solomon Codes	claim
202	120	Curve Tracking Control for Legged Locomotion in Horizontal Plane	claim
203	120	On the Feedback Capacity of Power Constrained Gaussian Noise Channels with Memory	claim
204	120	Remote laboratories: new technology and standard based architecture	claim
205	120	A Deterministic Approach to Wireless Relay Networks	claim
206	120	Random subcubes as a toy model for constraint satisfaction problems	claim
207	120	Distributed Fair Scheduling Using Variable Transmission Lengths in Carrier-Sensing-based Wireless Networks	claim
208	119	The framework for simulation of dynamics of mechanical aggregates	claim
209	119	Hadwiger and Helly-type theorems for disjoint unit spheres	claim
210	119	Hybrid-ARQ in Multihop Networks with Opportunistic Relay Selection	claim
211	119	On the ergodic sum-rate performance of CDD in multi-user systems	claim
212	119	Towards the Secrecy Capacity of the Gaussian MIMO Wire-tap Channel: The 2-2-1 Channel	claim
213	119	A New Achievability Scheme for the Relay Channel	claim
214	119	Using Description Logics for Recognising Textual Entailment	claim
215	119	Distributed Source Coding in the Presence of Byzantine Sensors	claim
216	119	Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs	claim
217	119	Pseudo-random Puncturing: A Technique to Lower the Error Floor of Turbo Codes	claim
218	118	A Measure of Transaction Processing 20 Years Later	claim
219	118	Discriminated Belief Propagation	claim
220	118	Error Rate Analysis for Peaky Signaling over Fading Channels	claim
221	118	Contains and Inside relationships within combinatorial Pyramids	claim
222	117	A Coding Theorem for a Class of Stationary Channels with Feedback	claim
223	117	Towards Execution Time Estimation for Logic Programs via Static Analysis and Profiling	claim
224	117	The Impact of CSI and Power Allocation on Relay Channel Capacity and Cooperation Strategies	claim
225	117	Dirac Notation, Fock Space and Riemann Metric Tensor in Information Retrieval Models	claim
226	117	Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions	claim
227	117	Sensor Networks with Random Links: Topology Design for Distributed Consensus	claim
228	117	Alternative axiomatics and complexity of deliberative STIT theories	claim
229	117	Definition sets for the Direct Kinematics of Parallel Manipulators	claim
230	117	A Note on Pricing Options on Defaultable Stocks	claim
231	117	Instrumented Collective Learning Situations (ICLS): the Gap between Theoretical Research and Observed Practices	claim
232	117	Dependable k-coverage algorithms for sensor networks	claim
233	117	A Geometric Interpretation of Fading in Wireless Networks: Theory and Applications	claim
234	117	An annotation based approach to support design communication	claim
235	117	Dynamic Logic of Common Knowledge in a Proof Assistant	claim
236	117	Non-atomic Games for Multi-User Systems	claim
237	117	MRI/TRUS data fusion for brachytherapy	claim
238	116	A presentation of Quantum Logic based on an "and then" connective	claim
239	116	The World as Evolving Information	claim
240	116	Scaling Laws of Cognitive Networks	claim
241	116	Frugal Colouring of Graphs	claim
242	116	On the Low-SNR Capacity of Phase-Shift Keying with Hard-Decision Detection	claim
243	116	Rate Bounds for MIMO Relay Channels Using Message Splitting	claim
244	116	DOEF: A Dynamic Object Evaluation Framework	claim
245	116	Non-Coherent Capacity and Reliability of Sparse Multipath Channels in the Wideband Regime	claim
246	116	International Standard for a Linguistic Annotation Framework	claim
247	116	Cooperative game theory and the Gaussian interference channel	claim
248	116	The Extended Edit Distance Metric	claim
249	116	Complexity of some Path Problems in DAGs and Linear Orders	claim
250	116	Simrank++: Query rewriting through link analysis of the click graph	claim
251	115	Using Table Valued Functions in SQL Server 2005 To Implement a Spatial Data Library	claim
252	115	FPRAS for computing a lower bound for weighted matching polynomial of graphs	claim
253	115	Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient	claim
254	115	Real Options for Project Schedules (ROPS)	claim
255	115	Random Linear Network Coding: A free cipher?	claim
256	115	Near Optimal Broadcast with Network Coding in Large Sensor Networks	claim
257	115	Computational performance of a parallelized high-order spectral and mortar element toolbox	claim
258	115	Q-adic Transform revisited	claim
259	115	Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators	claim
260	115	To Decode the Interference or To Consider it as Noise	claim
261	114	Complex networks and human language	claim
262	114	Queues Are Databases	claim
263	114	SECOQC White Paper on Quantum Key Distribution and Cryptography	claim
264	114	High Performance Direct Gravitational N-body Simulations on Graphics Processing Units	claim
265	114	Opportunistic Communications in an Orthogonal Multiaccess Relay Channel	claim
266	114	A Sequent Calculus for Modelling Interferences	claim
267	114	Design: One, but in different forms	claim
268	114	Fast Recursive Coding Based on Grouping of Symbols	claim
269	114	Self-organizing maps and symbolic data	claim
270	114	Hamiltonian Formulation of Quantum Error Correction and Correlated Noise	claim
271	114	SWI-Prolog and the Web	claim
272	114	3-D Self-Assembled Soi Mems: An Example of Multiphysics Simulation	claim
273	114	Distribution of Edge Load in Scale-free Trees	claim
274	114	On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian Block-Fading Channels	claim
275	113	Network Coding over a Noisy Relay : a Belief Propagation Approach	claim
276	113	Can Punctured Rate-1/2 Turbo Codes Achieve a Lower Error Floor than their Rate-1/3 Parent Codes?	claim
277	113	Turning the Liar paradox into a metatheorem of Basic logic	claim
278	113	Geometry and the complexity of matrix multiplication	claim
279	113	On the Kolmogorov-Chaitin Complexity for short sequences	claim
280	113	Fast paths in large-scale dynamic road networks	claim
281	113	On the Outage Capacity of a Practical Decoder Using Channel Estimation Accuracy	claim
282	113	Note on edge-colored graphs and digraphs without properly colored cycles	claim
283	113	Communication under Strong Asynchronism	claim
284	113	Virtual screening with support vector machines and structure kernels	claim
285	113	The road coloring problem	claim
286	113	Solution of moving-boundary problems by the spectral element method	claim
287	113	Emotion capture based on body postures and movements	claim
288	113	Designing as Construction of Representations: A Dynamic Viewpoint in Cognitive Design Research	claim
289	113	Braid Group Cryptography	claim
290	112	Precoding in Multiple-Antenna Broadcast Systems with a Probabilistic Viewpoint	claim
291	112	Adaptive Methods for Linear Programming Decoding	claim
292	112	Learning from compressed observations	claim
293	112	On Optimum Power Allocation for the V-BLAST	claim
294	112	Enumerating the Nash equilibria of rank 1-games	claim
295	112	Survivable MPLS Over Optical Transport Networks: Cost and Resource Usage Analysis	claim
296	112	In memoriam Maurice Gross	claim
297	111	Comments on "Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks"	claim
298	111	Capacity of Sparse Multipath Channels in the Ultra-Wideband Regime	claim
299	111	Hypocomputation	claim
300	111	Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution	claim
301	111	Separable and Low-Rank Continuous Games	claim
302	111	Micro-Ball Lens Array Fabrication in Photoresist Using Ptfe Hydrophobic Effect	claim
303	111	Circumspect descent prevails in solving random constraint satisfaction problems	claim
304	111	Influence of Memory Hierarchies on Predictability for Time Constrained Embedded Software	claim
305	111	Dynamic Multilevel Graph Visualization	claim
306	111	Link Scheduling in STDMA Wireless Networks: A Line Graph Approach	claim
307	111	A New Perspective on Multi-user Power Control Games in Interference Channels	claim
308	110	Free deconvolution for signal processing applications	claim
309	110	On formulas for decoding binary cyclic codes	claim
310	110	AMIE: An annotation model for information research	claim
311	110	Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting	claim
312	110	Computing Integer Powers in Floating-Point Arithmetic	claim
313	110	A Training based Distributed Non-Coherent Space-Time Coding Strategy	claim
314	110	e-Science initiatives in Venezuela	claim
315	110	Relations between random coding exponents and the statistical physics of random codes	claim
316	110	Graph Annotations in Modeling Complex Network Topologies	claim
317	110	Computer algebra in systems biology	claim
318	109	Delayed Sequential Coding of Correlated Sources	claim
319	109	The General Gaussian Multiple Access and Two-Way Wire-Tap Channels: Achievable Rates and Cooperative Jamming	claim
320	109	Multiresolution Approximation of Polygonal Curves in Linear Complexity	claim
321	109	Abstract machines for dialogue games	claim
322	109	PhantomOS: A Next Generation Grid Operating System	claim
323	109	A Framework to Illustrate Kinematic Behavior of Mechanisms by Haptic Feedback	claim
324	109	Optimal Causal Inference	claim
325	109	On the Outage Capacity of a Practical Decoder Accounting for Channel Estimation Inaccuracies	claim
326	109	Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching	claim
327	109	The MIMOME Channel	claim
328	109	Consistency of trace norm minimization	claim
329	109	Self-Organising management of Grid environments	claim
330	109	Algorithms for Generating Convex Sets in Acyclic Digraphs	claim
331	108	Noncoherent Low-Decoding-Complexity Space-Time Codes for Wireless Relay Networks	claim
332	108	Error Probability Analysis of Peaky Signaling over Fading Channels	claim
333	108	Scuba Search : when selection meets innovation	claim
334	108	SystemC Analysis of a New Dynamic Power Management Architecture	claim
335	108	Combining haplotypers	claim
336	108	Limited feedback achieves the empirical capacity	claim
337	108	Instruction sequences with indirect jumps	claim
338	108	The one-way function based on computational uncertainty principle	claim
339	108	Online EM Algorithm for Latent Data Models	claim
340	107	Asynchronous Distributed Searchlight Scheduling	claim
341	107	High-rate, Multi-Symbol-Decodable STBCs from Clifford Algebras	claim
342	107	Bounds on ordered codes and orthogonal arrays	claim
343	107	A tutorial on conformal prediction	claim
344	107	Kinematic Analysis of a New Parallel Machine Tool: the Orthoglide	claim
345	107	Functional Multi-Layer Perceptron: a Nonlinear Tool for Functional Data Analysis	claim
346	107	Risk Minimization and Optimal Derivative Design in a Principal Agent Game	claim
347	107	Automatic Coding Rule Conformance Checking Using Logic Programs	claim
348	107	How to realize "a sense of humour" in computers ?	claim
349	107	Morphological annotation of Korean with Directly Maintainable Resources	claim
350	106	A Backtracking-Based Algorithm for Computing Hypertree-Decompositions	claim
351	106	To BLOB or Not To BLOB: Large Object Storage in a Database or a Filesystem?	claim
352	106	Bandit Algorithms for Tree Search	claim
353	106	An algebraic generalization of Kripke structures	claim
354	106	Capacity of Underspread Noncoherent WSSUS Fading Channels under Peak Signal Constraints	claim
355	106	Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials	claim
356	106	Nano-Sim: A Step Wise Equivalent Conductance based Statistical Simulator for Nanotechnology Circuit Design	claim
357	106	Cryptanalysis of an image encryption scheme based on a new total shuffling algorithm	claim
358	106	On the Capacity of a Class of MIMO Cognitive Radios	claim
359	105	The source coding game with a cheating switcher	claim
360	105	A Simple Proof of the Entropy-Power Inequality via Properties of Mutual Information	claim
361	105	Finding low-weight polynomial multiples using discrete logarithm	claim
362	105	Optimal Order of Decoding for Max-Min Fairness in K-User Memoryless Interference Channels	claim
363	105	Applying the Z-transform for the static analysis of floating-point numerical filters	claim
364	105	Vector Precoding for Wireless MIMO Systems: A Replica Analysis	claim
365	105	Embedded Rank Distance Codes for ISI channels	claim
366	105	Relative-Error CUR Matrix Decompositions	claim
367	105	On Real-Time Communication Systems with Noisy Feedback	claim
368	105	Binary quantization using Belief Propagation with decimation over factor graphs of LDGM codes	claim
369	105	Automatic Methods for Analyzing Non-Repudiation Protocols with an Active Intruder	claim
370	105	Empirical Evaluation of Four Tensor Decomposition Algorithms	claim
371	105	Design and Modeling of a Mems-Based Valveless Pump Driven by an Electromagnetic Force	claim
372	105	A resource-based Korean morphological annotation system	claim
373	104	Byzantine Fault Tolerance for Nondeterministic Applications	claim
374	104	A Virtual Logo Keyboard for People with Motor Disabilities	claim
375	104	Searching for low weight pseudo-codewords	claim
376	104	Observable Graphs	claim
377	104	The Parameter-Less Self-Organizing Map algorithm	claim
378	104	A Collection of Definitions of Intelligence	claim
379	104	Sorting and Selection in Posets	claim
380	104	Sources of Superlinearity in Davenport-Schinzel Sequences	claim
381	104	Separable convex optimization problems with linear ascending constraints	claim
382	104	Multi-physics Extension of OpenFMO Framework	claim
383	104	Double Clustering and Graph Navigability	claim
384	104	Constructions for Difference Triangle Sets	claim
385	104	Explicit Non-Adaptive Combinatorial Group Testing Schemes	claim
386	103	Discrete Memoryless Interference and Broadcast Channels with Confidential Messages: Secrecy Rate Regions	claim
387	103	An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem	claim
388	103	Recommending Related Papers Based on Digital Library Access Records	claim
389	103	Interactive Small-Step Algorithms I: Axiomatization	claim
390	103	Moderate Growth Time Series for Dynamic Combinatorics Modelisation	claim
391	103	HORPO with Computability Closure : A Reconstruction	claim
392	103	Physical limits of inference	claim
393	103	Evaluation of a Grammar of French Determiners	claim
394	103	An explicit universal cycle for the (n-1)-permutations of an n-set	claim
395	102	Time Series Forecasting: Obtaining Long Term Trends with Self-Organizing Maps	claim
396	102	Sudo-Lyndon	claim
397	102	Neighbor Selection and Hitting Probability in Small-World Graphs	claim
398	102	Solving Triangular Peg Solitaire	claim
399	102	Some information-theoretic computations related to the distribution of prime numbers	claim
400	102	Entity Ranking in Wikipedia	claim
401	102	Near-Deterministic Inference of AS Relationships	claim
402	101	Tracking Stopping Times	claim
403	101	Variable-Rate Distributed Source Coding in the Presence of Byzantine Sensors	claim
404	101	Curry-style type Isomorphisms and Game Semantics	claim
405	101	Unfolding Orthogonal Terrains	claim
406	101	OA@MPS - a colourful view	claim
407	101	A Matrix Ring Description for Cyclic Convolutional Codes	claim
408	101	On The Limitations of The Naive Lattice Decoding	claim
409	101	The annealing induced extraordinary properties of SI based ZNO film grown by RF sputtering	claim
410	101	Low SNR Capacity of Noncoherent Fading Channels	claim
411	100	Interference Automata	claim
412	100	The Haar Wavelet Transform of a Dendrogram: Additional Notes	claim
413	100	The Hadwiger Number of Jordan Regions is Unbounded	claim
414	100	Finite Volume Analysis of Nonlinear Thermo-mechanical Dynamics of Shape Memory Alloys	claim
415	100	The Octagon Abstract Domain	claim
416	100	Distributed Transmit Diversity in Relay Networks	claim
417	100	Unfolding Convex Polyhedra via Quasigeodesics	claim
418	100	Stability analysis of a max-min fair Rate Control Protocol (RCP) in a small buffer regime	claim
419	100	Identifying statistical dependence in genomic sequences via mutual information estimates	claim
420	99	On factorisation forests	claim
421	99	Entropy vectors and network codes	claim
422	99	A parametric representation of totally mixed Nash equilibria	claim
423	99	Optimal Routing for Decode-and-Forward based Cooperation in Wireless Networks	claim
424	99	Regions of Feasible Point-to-Point Trajectories in the Cartesian Workspace of Fully-Parallel Manipulators	claim
425	99	Average Stopping Set Weight Distribution of Redundant Random Matrix Ensembles	claim
426	99	Evolutionary Mesh Numbering: Preliminary Results	claim
427	99	Services within a busy period of an M/M/1 queue and Dyck paths	claim
428	99	Periodic complementary sets of binary sequences	claim
429	99	High Rate Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks	claim
430	99	Fast Selection of Spectral Variables with B-Spline Compression	claim
431	99	The Importance and Criticality of Spreadsheets in the City of London	claim
432	99	Machine structure oriented control code logic	claim
433	99	Changing Levels of Description in a Fluid Flow Simulation	claim
434	98	Propositional theories are strongly equivalent to logic programs	claim
435	98	Bistable Biorders: A Sequential Domain Theory	claim
436	98	Transforming structures by set interpretations	claim
437	98	Signal Set Design for Full-Diversity Low-Decoding-Complexity Differential Scaled-Unitary STBCs	claim
438	98	The Complexity of Weighted Boolean #CSP	claim
439	98	Realistic Rendering of Kinetostatic Indices of Mechanisms	claim
440	98	Defensive forecasting for optimal prediction with expert advice	claim
441	98	Enrichment of Qualitative Beliefs for Reasoning under Uncertainty	claim
442	98	Normalisation Control in Deep Inference Via Atomic Flows	claim
443	98	WWW Spiders: an introduction	claim
444	98	The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions	claim
445	98	Guarded Hybrid Knowledge Bases	claim
446	97	Estimation of the Rate-Distortion Function	claim
447	97	Longest Common Separable Pattern between Permutations	claim
448	97	A Few Graph-Based Relational Numerical Abstract Domains	claim
449	97	IRVO: an Interaction Model for designing Collaborative Mixed Reality systems	claim
450	97	Neutrality and Many-Valued Logics	claim
451	97	Side-information Scalable Source Coding	claim
452	97	Unfolding Restricted Convex Caps	claim
453	97	Solving Infinite Kolam in Knot Theory	claim
454	97	Electrostatically-Driven Resonator on Soi with Improved Temperature Stability	claim
455	96	A decision procedure for linear "big O" equations	claim
456	96	The Laplace-Jaynes approach to induction	claim
457	96	The Distance Geometry of Music	claim
458	96	Understanding the Properties of the BitTorrent Overlay	claim
459	96	Edit and verify	claim
460	96	Exact Cover with light	claim
461	96	New Complexity Bounds for Certain Real Fewnomial Zero Sets	claim
462	96	Common Beliefs and Public Announcements in Strategic Games with Arbitrary Strategy Sets	claim
463	96	Non-linear estimation is easy	claim
464	95	A Note on the Periodicity and the Output Rate of Bit Search Type Generators	claim
465	95	Slope One Predictors for Online Rating-Based Collaborative Filtering	claim
466	95	Support-Graph Preconditioners for 2-Dimensional Trusses	claim
467	95	Scheduling in Data Intensive and Network Aware (DIANA) Grid Environments	claim
468	95	Spectrum Sensing in Cognitive Radios Based on Multiple Cyclic Frequencies	claim
469	95	Solving the subset-sum problem with a light-based device	claim
470	95	Rateless Coding for Gaussian Channels	claim
471	95	Do oral messages help visual search?	claim
472	95	Resampling methods for parameter-free and robust feature selection with mutual information	claim
473	95	Prediction with expert advice for the Brier game	claim
474	95	TP Decoding	claim
475	95	On Capacity Scaling in Arbitrary Wireless Networks	claim
476	95	Parametric Yield Analysis of Mems via Statistical Methods	claim
477	95	Protocols For Half-Duplex Multiple Relay Networks	claim
478	94	Some Issues on Incremental Abstraction-Carrying Code	claim
479	94	Statistical tools to assess the reliability of self-organizing maps	claim
480	94	Negotiation in collaborative assessment of design solutions: an empirical study on a Concurrent Engineering process	claim
481	94	Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm	claim
482	94	Exploring the academic invisible web	claim
483	94	Size reduction of complex networks preserving modularity	claim
484	94	Writing on Dirty Paper with Resizing and its Application to Quasi-Static Fading Broadcast Channels	claim
485	94	Neighbor Discovery in Wireless Networks:A Multiuser-Detection Approach	claim
486	94	Universal Quantile Estimation with Feedback in the Communication-Constrained Setting	claim
487	94	Encounter-based worms: Analysis and Defense	claim
488	94	Pushdown Compression	claim
489	94	Spreadsheet Risk - A New Direction for HMRC?	claim
490	93	Simultaneous Communication of Data and State	claim
491	93	Intrinsic dimension of a dataset: what properties does one expect?	claim
492	93	Direct Optimization of Ranking Measures	claim
493	93	Stochastic Optimization Algorithms	claim
494	93	Performance Analysis for Multichannel Reception of OOFSK Signaling	claim
495	93	Collaborative product and process model: Multiple Viewpoints approach	claim
496	93	Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort	claim
497	93	Opportunistic Scheduling and Beamforming for MIMO-SDMA Downlink Systems with Linear Combining	claim
498	93	Performance Analysis of Publish/Subscribe Systems	claim
499	93	Garside monoids vs divisibility monoids	claim
500	93	Solving the Hamiltonian path problem with a light-based computer	claim
501	93	Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops	claim
502	93	Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations	claim
503	93	A Framework for Providing E-Services to the Rural Areas using Wireless Ad Hoc and Sensor Networks	claim
504	93	Distinguishing Short Quantum Computations	claim
505	92	Characterization of Rate Region in Interference Channels with Constrained Power	claim
506	92	Graphs, Quadratic Forms, and Quantum Codes	claim
507	92	Revisiting the Issues On Netflow Sample and Export Performance	claim
508	92	Quantum Shortest Path Netsukuku	claim
509	92	Bit-Interleaved Coded Multiple Beamforming with Imperfect CSIT	claim
510	92	Passive Control Architecture for Virtual Humans	claim
511	92	Using RDF to Model the Structure and Process of Systems	claim
512	92	Overlap-free words and spectra of matrices	claim
513	92	CD(4) has bounded width	claim
514	92	Throughput Scaling in Random Wireless Networks: A Non-Hierarchical Multipath Routing Strategy	claim
515	92	A Novel Contact Resistance Model of Anisotropic Conductive Film for FPD Packaging	claim
516	92	Trading in Risk Dimensions (TRD)	claim
517	92	TRUST-TECH based Methods for Optimization and Learning	claim
518	92	Enabling Adaptive Grid Scheduling and Resource Management	claim
519	91	BrlAPI: Simple, Portable, Concurrent, Application-level Control of Braille Terminals	claim
520	91	The on-line shortest path problem under partial monitoring	claim
521	91	Many-to-One Throughput Capacity of IEEE 802.11 Multi-hop Wireless Networks	claim
522	91	Classical Interaction Cannot Replace a Quantum Message	claim
523	91	Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources	claim
524	91	Unequal dimensional small balls and quantization on Grassmann Manifolds	claim
525	91	A Comparison of Push and Pull Techniques for Ajax	claim
526	91	A Classification of 3R Orthogonal Manipulators by the Topology of their Workspace	claim
527	91	The Kinetostatic Optimization of a Novel Prismatic Drive	claim
528	91	Decomposable Subspaces, Linear Sections of Grassmann Varieties, and Higher Weights of Grassmann Codes	claim
529	91	Kinematic calibration of orthoglide-type mechanisms	claim
530	91	Parasitic Effects Reduction for Wafer-Level Packaging of RF-Mems	claim
531	91	An Active Chaotic Micromixer Integrating Thermal Actuation Associating PDMS and Silicon Microtechnology	claim
532	91	Au-SN Flip-Chip Solder Bump for Microelectronic and Optoelectronic Applications	claim
533	91	Single-Exclusion Number and the Stopping Redundancy of MDS Codes	claim
534	91	On types of growth for graph-different permutations	claim
535	90	Predicate Abstraction with Under-approximation Refinement	claim
536	90	The Rise and Rise of Citation Analysis	claim
537	90	Recommender System for Online Dating Service	claim
538	90	A New Six Degree-of-Freedom Haptic Device based on the Orthoglide and the Agile Eye	claim
539	90	Learning Probabilistic Models of Word Sense Disambiguation	claim
540	90	Discrete Denoising with Shifts	claim
541	90	Mutual information for the selection of relevant variables in spectrometric nonlinear modelling	claim
542	90	IEEE 1149.4 Compatible ABMs for Basic RF Measurements	claim
543	90	Rateless coding with partial state information at the decoder	claim
544	89	Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure	claim
545	89	TCP throughput guarantee in the DiffServ Assured Forwarding service: what about the results?	claim
546	89	Evaluating Personal Archiving Strategies for Internet-based Information	claim
547	89	The Isoconditioning Loci of Planar Three-DOF Parallel Manipulators	claim
548	89	The Orthoglide: Kinematics and Workspace Analysis	claim
549	89	Speeding up Simplification of Polygonal Curves using Nested Approximations	claim
550	89	Hardware Support for QoS-based Function Allocation in Reconfigurable Systems	claim
551	89	Analog Chaos-based Secure Communications and Cryptanalysis: A Brief Survey	claim
552	89	Channel Code Design with Causal Side Information at the Encoder	claim
553	89	Constructing a maximum utility slate of on-line advertisements	claim
554	88	Uniform and Partially Uniform Redistribution Rules	claim
555	88	Avoiding bias in cards cryptography	claim
556	88	Perfect Hashing for Data Management Applications	claim
557	88	Target assignment for robotic networks: asymptotic performance under limited communication	claim
558	88	Minimum cost distributed source coding over a network	claim
559	88	Comparison of Discrete and Continuous Wavelet Transforms	claim
560	88	Decisive Markov Chains	claim
561	88	Faster subsequence recognition in compressed strings	claim
562	88	Relationship between clustering and algorithmic phase transitions in the random k-XORSAT model and its NP-complete extensions	claim
563	88	A software for learning Information Theory basics with emphasis on Entropy of Spanish	claim
564	88	The Parallel-Sequential Duality : Matrices and Graphs	claim
565	88	A generic attack to ciphers	claim
566	88	Augmented Tree-based Routing Protocol for Scalable Ad Hoc Networks	claim
567	88	Design and Fabrication of a Micro Electrostatic Vibration-to-Electricity Energy Converter	claim
568	88	Macro and Micro Scale Electromagnetic Kinetic Energy Harvesting Generators	claim
569	87	Symbol Error Rates of Maximum-Likelihood Detector: Convex/Concave Behavior and Applications	claim
570	87	Double Sided Watermark Embedding and Detection with Perceptual Analysis	claim
571	87	Detection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency	claim
572	87	Sequential products in effect categories	claim
573	87	Updating Probabilities with Data and Moments	claim
574	87	Entropy of capacities on lattices and set systems	claim
575	87	Bi-capacities -- Part II: the Choquet integral	claim
576	86	Missing values : processing with the Kohonen algorithm	claim
577	86	On the Discovery of Random Trees	claim
578	86	A Simple Characterization of Strategic Behaviors in Broadcast Channels	claim
579	86	Semantic distillation: a method for clustering objects by their contextual specificity	claim
580	86	Measuring and Monitoring Grid Resource Utilisation	claim
581	86	Variations on Information Embedding in Multiple Access and Broadcast Channels	claim
582	86	Fabrication of Switches on Polymer-Based by Hot Embossing	claim
583	86	Delaunay Edge Flips in Dense Surface Triangulations	claim
584	85	Polynomial time algorithms to approximate mixed volumes within a simply exponential factor	claim
585	85	A multivariate interlace polynomial	claim
586	85	Dynamic Random Geometric Graphs	claim
587	85	Multimodal Meaning Representation for Generic Dialogue Systems Architectures	claim
588	85	Interface groups and financial transfer architectures	claim
589	85	The star trellis decoding of Reed-Solomon codes	claim
590	85	Queues, stores, and tableaux	claim
591	85	Optimising the topology of complex neural networks	claim
592	85	P-matrix recognition is co-NP-complete	claim
593	85	Querying XML Documents in Logic Programming	claim
594	85	Minimization of entropy functionals	claim
595	85	Maximizing PageRank via outlinks	claim
596	84	Linear versus Non-linear Acquisition of Step-Functions	claim
597	84	MMSE Optimal Algebraic Space-Time Codes	claim
598	84	Symbolic Methods to Enhance the Precision of Numerical Abstract Domains	claim
599	84	Undirected Graphs of Entanglement Two	claim
600	84	Collection analysis for Horn clause programs	claim
601	84	On the role of autocorrelations in texts	claim
602	84	Spreadsheets in Clinical Medicine	claim
603	83	Indexing the Sphere with the Hierarchical Triangular Mesh	claim
604	83	Simulation of Phase Combinations in Shape Memory Alloys Patches by Hybrid Optimization Methods	claim
605	83	Sampling Eulerian orientations of triangular lattice graphs	claim
606	83	Parametric Learning and Monte Carlo Optimization	claim
607	83	Capacity of a Class of Modulo-Sum Relay Channels	claim
608	83	On How Developers Test Open Source Software Systems	claim
609	83	Sensitivity Analysis of the Orthoglide, a 3-DOF Translational Parallel Kinematic Machine	claim
610	83	Characterisation of the Etching Quality in Micro-Electro-Mechanical Systems by Thermal Transient Methodology	claim
611	83	A Ku-Band Novel Micromachined Bandpass Filter with Two Transmission Zeros	claim
612	83	Time and the Prisoner's Dilemma	claim
613	82	Programs as polygraphs: computability and complexity	claim
614	82	Thousands of DebitCredit Transactions-Per-Second: Easy and Inexpensive	claim
615	82	One-bit Distributed Sensing and Coding for Field Estimation in Sensor Networks	claim
616	82	Mathematical analysis of the recoil growth algorithm to generate multi-polymer systems	claim
617	82	Sorting and Selection with Random Costs	claim
618	82	Proof nets for display logic	claim
619	82	Lexicon management and standard formats	claim
620	81	Throughput Scaling Laws for Wireless Networks with Fading Channels	claim
621	81	Matrix norms and rapid mixing for spin systems	claim
622	81	A Landscape Analysis of Constraint Satisfaction Problems	claim
623	81	A Note on Ontology and Ordinary Language	claim
624	81	Faster exon assembly by sparse spliced alignment	claim
625	80	Polygraphs for termination of left-linear term rewriting systems	claim
626	80	Uniqueness Domains in the Workspace of Parallel Manipulators	claim
627	80	Experiences of Engineering Grid-Based Medical Software	claim
628	80	Multisource Bayesian sequential change detection	claim
629	80	A structure from motion inequality	claim
630	80	A Greedy Randomized Adaptive Search Procedure for Technicians and Interventions Scheduling for Telecommunications	claim
631	79	Logic Meets Algebra: the Case of Regular Languages	claim
632	79	Type-II/III DCT/DST algorithms with reduced number of arithmetic operations	claim
633	79	Connecting Polygonizations via Stretches and Twangs	claim
634	79	Representation of Functional Data in Neural Networks	claim
635	79	L'analyse de l'expertise du point de vue de l'ergonomie cognitive	claim
636	79	Singular Curves in the Joint Space and Cusp Points of 3-RPR parallel manipulators	claim
637	79	Ontology and Formal Semantics - Integration Overdue	claim
638	79	Stop That Subversive Spreadsheet!	claim
639	78	A probabilistic analysis of a leader election algorithm	claim
640	78	Tag-Cloud Drawing: Algorithms for Cloud Visualization	claim
641	78	GLRT-Optimal Noncoherent Lattice Decoding	claim
642	78	Power Allocation for Discrete-Input Non-Ergodic Block-Fading Channels	claim
643	78	Hybrid Branching-Time Logics	claim
644	78	Priority Queue Based on Multilevel Prefix Tree	claim
645	78	A New Lower Bound on Guard Placement for Wireless Localization	claim
646	78	A Game Theoretic Approach to Quantum Information	claim
647	78	Designing a commutative replicated data type	claim
648	78	Solving Simple Stochastic Games with Few Random Vertices	claim
649	77	Error Correction and Digitalization Concepts in Biochemical Computing	claim
650	77	The Multiobjective Optimization of a Prismatic Drive	claim
651	77	Quantization Bounds on Grassmann Manifolds of Arbitrary Dimensions and MIMO Communications with Feedback	claim
652	77	On the interaction between sharing and linearity	claim
653	77	Numerical removal of water-vapor effects from THz-TDS measurements	claim
654	77	Query Evaluation and Optimization in the Semantic Web	claim
655	76	Power Optimal Scheduling for Guaranteed Throughput in Multi-access Fading Channels	claim
656	76	Guessing based on length functions	claim
657	76	Portlet Wrappers using JavaScript	claim
658	76	Some problems in asymptotic convex geometry and random matrices motivated by numerical algorithms	claim
659	76	Morphing Ensemble Kalman Filters	claim
660	76	Tripartitions do not always discriminate phylogenetic networks	claim
661	76	A Light-Based Device for Solving the Hamiltonian Path Problem	claim
662	76	Universal coding for correlated sources with complementary delivery	claim
663	76	Optimizing diversity	claim
664	76	Resolution Limits for Resonant Mems Sensors Based on Discrete Relay Feedback Techniques	claim
665	75	Polyhedral representation conversion up to symmetries	claim
666	75	On Undetected Error Probability of Binary Matrix Ensembles	claim
667	75	Multiplication of free random variables and the S-transform: the case of vanishing mean	claim
668	75	Outage Behavior of Discrete Memoryless Channels Under Channel Estimation Errors	claim
669	75	Wavelet Based Semi-blind Channel Estimation For Multiband OFDM	claim
670	75	On Ullman's theorem in computer vision	claim
671	75	Optimum Diversity-Multiplexing Tradeoff in the Multiple Relays Network	claim
672	74	Redesigning Decision Matrix Method with an indeterminacy-based inference process	claim
673	74	Periodicity of certain piecewise affine planar maps	claim
674	74	Secure Two-party Protocols for Point Inclusion Problem	claim
675	74	Computing Minimal Polynomials of Matrices	claim
676	74	Stability of boundary measures	claim
677	74	L'orthoglide : une machine-outil rapide d'architecture parallèle isotrope	claim
678	74	Parity Forwarding for Multiple-Relay Networks	claim
679	74	A Silicon-Based Micro Gas Turbine Engine for Power Generation	claim
680	74	Packaging of RF Mems Switching Functions on Alumina Substrate	claim
681	73	A Case For Amplify-Forward Relaying in the Block-Fading Multi-Access Channel	claim
682	73	The Kinematic design of a 3-dof Hybrid Manipulator	claim
683	73	The Optimal Design of Three Degree-of-Freedom Parallel Mechanisms for Machining Applications	claim
684	73	Universal Reinforcement Learning	claim
685	73	Efficient supervised learning in networks with binary synapses	claim
686	73	Energy Conversion Using New Thermoelectric Generator	claim
687	73	The Earth System Grid: Supporting the Next Generation of Climate Modeling Research	claim
688	72	Outage Probability of Multiple-Input Single-Output (MISO) Systems with Delayed Feedback	claim
689	72	How much feedback is required in MIMO Broadcast Channels?	claim
690	72	WACA: A Hierarchical Weighted Clustering Algorithm optimized for Mobile Hybrid Networks	claim
691	72	A Proof of a Recursion for Bessel Moments	claim
692	72	A Heuristic Routing Mechanism Using a New Addressing Scheme	claim
693	72	Cryptanalysis of an Image Encryption Scheme Based on a Compound Chaotic Sequence	claim
694	71	On the Maximal Diversity Order of Spatial Multiplexing with Transmit Antenna Selection	claim
695	71	The PBD-Closure of Constant-Composition Codes	claim
696	70	Secure Broadcasting	claim
697	70	Open Access Scientometrics and the UK Research Assessment Exercise	claim
698	70	Constructive Conjugate Codes for Quantum Error Correction and Cryptography	claim
699	70	On the Proof Complexity of Deep Inference	claim
700	70	Cryptanalysis of a computer cryptography scheme based on a filter bank	claim
701	70	Contactless Thermal Characterization Method of PCB-s Using an IR Sensor Array	claim
702	70	Opportunistic Relaying in Wireless Networks	claim
703	69	Mixing the Objective Caml and C# Programming Models in the .Net Framework	claim
704	69	A Formal Model of Dictionary Structure and Content	claim
705	69	Wireless Network Information Flow	claim
706	69	Lossless Representation of Graphs using Distributions	claim
707	69	Image Classification Using SVMs: One-against-One Vs One-against-All	claim
708	68	The Road to Quantum Artificial Intelligence	claim
709	68	An Improved Tight Closure Algorithm for Integer Octagonal Constraints	claim
710	68	The Domino Problem of the Hyperbolic Plane Is Undecidable	claim
711	68	A numerical approach for 3D manufacturing tolerances synthesis	claim
712	68	Recent Developments in Mems-Based Micro Fuel Cells	claim
713	68	Lagrangian Relaxation and Partial Cover	claim
714	67	On vocabulary size of grammar-based codes	claim
715	67	Interroger un corpus par le sens	claim
716	67	Precoding for the AWGN Channel with Discrete Interference	claim
717	67	Novelty and Collective Attention	claim
718	67	Generalizing Consistency and other Constraint Properties to Quantified Constraints	claim
719	67	Valid formulas, games and network protocols	claim
720	67	Matrix-Lifting Semi-Definite Programming for Decoding in Multiple Antenna Systems	claim
721	66	On Faster Integer Calculations using Non-Arithmetic Primitives	claim
722	66	Miniaturized Fluorescence Excitation Platform with Optical Fiber for Bio-Detection Chips	claim
723	65	Text Line Segmentation of Historical Documents: a Survey	claim
724	65	Scalability and Optimisation of a Committee of Agents Using Genetic Algorithm	claim
725	65	Computability of simple games: A characterization and application to the core	claim
726	65	Multiple Access Channels with Generalized Feedback and Confidential Messages	claim
727	65	How to be correct, lazy and efficient ?	claim
728	65	The P versus NP Brief	claim
729	64	Optimal Sequential Frame Synchronization	claim
730	64	Series which are both max-plus and min-plus rational are unambiguous	claim
731	64	Generating models for temporal representations	claim
732	64	Concave Microlens Array Mold Fabrication in Photoresist Using UV Proximity Printing	claim
733	64	Process Issues for a Multi-Layer Microelectrofluidic Platform	claim
734	64	Faster polynomial multiplication via multipoint Kronecker substitution	claim
735	63	Optimizing the SINR operating point of spatial networks	claim
736	63	WDM and Directed Star Arboricity	claim
737	63	Four-Group Decodable Space-Time Block Codes	claim
738	63	Using Data Compressors to Construct Rank Tests	claim
739	63	Navigability of Complex Networks	claim
740	62	Optimal Choice of Threshold in Two Level Processor Sharing	claim
741	61	Asymptotic Capacity Bounds for Wireless Networks with Non-Uniform Traffic	claim
742	61	The Secrecy Capacity of the MIMO Wiretap Channel	claim
743	61	Surface Conditioning Effect on Vacuum Microelectronics Components Fabricated by Deep Reactive Ion Etching	claim
744	60	Large-Scale Query and XMatch, Entering the Parallel Zone	claim
745	60	Constructions of Grassmannian Simplices	claim
746	60	On Minimal Tree Realizations of Linear Codes	claim
747	59	On the use of self-organizing maps to accelerate vector quantization	claim
748	59	Using Synchronic and Diachronic Relations for Summarizing Multiple Documents Describing Evolving Events	claim
749	59	Scaling Effects for Electromagnetic Vibrational Power Generators	claim
750	58	Report on Generic Case Complexity	claim
751	58	Electromechanical Reliability Testing of Three-Axial Silicon Force Sensors	claim
752	57	On Evaluating the Rate-Distortion Function of Sources with Feed-Forward and the Capacity of Channels with Feedback	claim
753	57	Optimization of Piezoelectric Electrical Generators Powered by Random Vibrations	claim
754	57	Smartening the Environment using Wireless Sensor Networks in a Developing Country	claim
755	56	Signature Sequence of Intersection Curve of Two Quadrics for Exact Morphological Classification	claim
756	56	Connectivity and Equilibrium in Random Games	claim
757	56	Elementary transformation analysis for Array-OL	claim
758	56	A competitive multi-agent model of interbank payment systems	claim
759	56	Duality and Stability Regions of Multi-rate Broadcast and Multiple Access Networks	claim
760	56	Relative Strength of Strategy Elimination Procedures	claim
761	56	Deciding security properties for cryptographic protocols. Application to key cycles	claim
762	56	Design Strategies for the Geometric Synthesis of Orthoglide-type Mechanisms	claim
763	55	Semi-local string comparison: algorithmic techniques and applications	claim
764	54	On the monotonization of the training set	claim
765	54	A Practical Ontology for the Large-Scale Modeling of Scholarly Artifacts and their Usage	claim
766	53	The Open Access Citation Advantage: Quality Advantage Or Quality Bias?	claim
767	53	Deterministic list codes for state-constrained arbitrarily varying channels	claim
768	53	On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes	claim
769	53	Structure or Noise?	claim
770	52	Hierarchical Unambiguity	claim
771	52	Traitement Des Donnees Manquantes Au Moyen De L'Algorithme De Kohonen	claim
772	52	Scanning and Sequential Decision Making for Multi-Dimensional Data - Part II: the Noisy Case	claim
773	52	Public Cluster : parallel machine with multi-block approach	claim
774	52	A Constraint Network Based Approach to Memory Layout Optimization	claim
775	51	Why is a new Journal of Informetrics needed?	claim
776	51	Workspace Analysis of the Orthoglide using Interval Analysis	claim
777	51	Projection semantics for rigid loops	claim
778	51	The Frobenius Problem in a Free Monoid	claim
779	51	Spectrum Sensing in Wideband OFDM Cognitive Radios	claim
780	50	An empirical study of software reuse by experts in object-oriented design	claim
781	50	On The Capacity Of Time-Varying Channels With Periodic Feedback	claim
782	50	Towards Informative Statistical Flow Inversion	claim
783	49	Asymptotic Analysis of Amplify and Forward Relaying in a Parallel MIMO Relay Network	claim
784	49	Optimal Iris Fuzzy Sketches	claim
785	49	Efficient Divide-and-Conquer Simulations Of Symmetric FSAs	claim
786	49	The rank-width of Directed Graphs	claim
787	49	On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling	claim
788	49	Power Processing Circuits for Mems Inertial Energy Scavengers	claim
789	47	A randomized algorithm for the on-line weighted bipartite matching problem	claim
790	47	Resource control of object-oriented programs	claim
791	47	Data Structures for Mergeable Trees	claim
792	47	Reduced-Order Modelling of the Bending of an Array of Torsional Micromirrors	claim
793	46	Abstract numeration systems on bounded languages and multiplication by a constant	claim
794	46	A preliminary analysis on metaheuristics methods applied to the Haplotype Inference Problem	claim
795	45	Minimum Expected Distortion in Gaussian Layered Broadcast Coding with Successive Refinement	claim
796	44	Temporal Reasoning without Transitive Tables	claim
797	39	MIMO-OFDM Optimal Decoding and Achievable Information Rates Under Imperfect Channel Estimation	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers